Results 1  10
of
22,352
FAMILIES OF HYPERSURFACES OF LARGE DEGREE
"... Abstract. We show that general moving enough families of high degree hypersurfaces in P n+1 do not have a dominant set of sections. ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Abstract. We show that general moving enough families of high degree hypersurfaces in P n+1 do not have a dominant set of sections.
The spread of obesity in a large social network over 32 years
 NEW ENGLAND JOURNAL OF MEDICINE
, 2007
"... The prevalence of obesity has increased substantially over the past 30 years. We performed a quantitative analysis of the nature and extent of the persontoperson spread of obesity as a possible factor contributing to the obesity epidemic. Methods We evaluated a densely interconnected social networ ..."
Abstract

Cited by 509 (23 self)
 Add to MetaCart
, spouse, and neighbors. Results Discernible clusters of obese persons (bodymass index [the weight in kilograms divided by the square of the height in meters], ≥30) were present in the network at all time points, and the clusters extended to three degrees of separation. These clusters did not appear
GROUPS WITH A CHARACTER OF LARGE DEGREE
"... Abstract. Let G be a finite group of order n and V asimpleC[G]module of dimension d. For some nonnegative number e, wehaven = d(d + e). If e is small, then the character of V has unusually large degree. We fix e and attempt to classify such groups. For e ≤ 3 we give a complete classification. Foran ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. Let G be a finite group of order n and V asimpleC[G]module of dimension d. For some nonnegative number e, wehaven = d(d + e). If e is small, then the character of V has unusually large degree. We fix e and attempt to classify such groups. For e ≤ 3 we give a complete classification
Hcolorings of Large Degree Graphs
, 2002
"... We consider the Hcoloring problem on graphs with vertices of large degree. We prove that for H an odd cycle, the problem belongs to P. We also study the phase transition of the problem, for an in finite family of graphs of a given chromatic number, i.e. the threshold density value for which the ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We consider the Hcoloring problem on graphs with vertices of large degree. We prove that for H an odd cycle, the problem belongs to P. We also study the phase transition of the problem, for an in finite family of graphs of a given chromatic number, i.e. the threshold density value for which
The complexity of theoremproving procedures
 IN STOC
, 1971
"... It is shown that any recognition problem solved by a polynomial timebounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology. Here “reduced ” means, roughly speaking, that the first problem can be solved deterministi ..."
Abstract

Cited by 1050 (5 self)
 Add to MetaCart
deterministically in polynomial time provided an oracle is available for solving the second. From this notion of reducible, polynomial degrees of difficulty are defined, and it is shown that the problem of determining tautologyhood has the same polynomial degree as the problem of determining whether the first
Coda: A Highly Available File System for a Distributed Workstation Environment
 IN IEEE TRANSACTIONS ON COMPUTERS
, 1990
"... Coda is a file system for a largescale distributed computing environment composed of Unix workstations. It provides resiliency to server and network failures through the use of two distinct but complementary mechanisms. One mechanism, server replication,stores copies of a file at multiple servers ..."
Abstract

Cited by 530 (45 self)
 Add to MetaCart
Coda is a file system for a largescale distributed computing environment composed of Unix workstations. It provides resiliency to server and network failures through the use of two distinct but complementary mechanisms. One mechanism, server replication,stores copies of a file at multiple
FANO VARIETIES WITH LARGE DEGREE ENDOMORPHISMS
, 901
"... We work over the complex number field C. An endomorphism of a projective variety X is a morphism f: X → X. If f is surjective, then it is automatically finite. Examples of projective varieties with an endomorphism of degree> 1 are P n and abelian varieties. In fact, these are essentially all know ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
is less or equal to 3 [ARV99], when X is a quasihomogeneous [HN08], when X is a large degree hypersurface of a prime Fano manifold of Picard number 1 [Ch08], or when X contains a smooth conic [HM03]. [Zh08] considered Fano varieties with Picard number 1 and, with terminal singularities that have
Numerical integration of the Cartesian equations of motion of a system with constraints: molecular dynamics of nalkanes
 J. Comput. Phys
, 1977
"... A numerical algorithm integrating the 3N Cartesian equations of motion of a system of N points subject to holonomic constraints is formulated. The relations of constraint remain perfectly fulfilled at each step of the trajectory despite the approximate character of numerical integration. The method ..."
Abstract

Cited by 704 (6 self)
 Add to MetaCart
is applied to a molecular dynamics simulation of a liquid of 64 nbutane molecules and compared to a simulation using generalized coordinates. The method should be useful for molecular dynamics calculations on large molecules with internal degrees of freedom. 1. INTR~D~JCTI~N The method of molecular dynamics
Measurement and Analysis of Online Social Networks
 In Proceedings of the 5th ACM/USENIX Internet Measurement Conference (IMC’07
, 2007
"... Online social networking sites like Orkut, YouTube, and Flickr are among the most popular sites on the Internet. Users of these sites form a social network, which provides a powerful means of sharing, organizing, and finding content and contacts. The popularity of these sites provides an opportunity ..."
Abstract

Cited by 698 (14 self)
 Add to MetaCart
an opportunity to study the characteristics of online social network graphs at large scale. Understanding these graphs is important, both to improve current systems and to design new applications of online social networks. This paper presents a largescale measurement study and analysis of the structure
Crowds: Anonymity for Web Transactions
 ACM Transactions on Information and System Security
, 1997
"... this paper we introduce a system called Crowds for protecting users' anonymity on the worldwide web. Crowds, named for the notion of "blending into a crowd", operates by grouping users into a large and geographically diverse group (crowd) that collectively issues requests on behalf o ..."
Abstract

Cited by 838 (13 self)
 Add to MetaCart
this paper we introduce a system called Crowds for protecting users' anonymity on the worldwide web. Crowds, named for the notion of "blending into a crowd", operates by grouping users into a large and geographically diverse group (crowd) that collectively issues requests on behalf
Results 1  10
of
22,352