Results 1  10
of
4,178,807
StrategyProofness and Arrow’s Conditions: Existence and Correspondence Theorems for Voting Procedures and Social Welfare Functions
 J. Econ. Theory
, 1975
"... Consider a committee which must select one alternative from a set of three or more alternatives. Committee members each cast a ballot which the voting procedure counts. The voting procedure is strategyproof if it always induces every committee member to cast a ballot revealing his preference. I pro ..."
Abstract

Cited by 542 (0 self)
 Add to MetaCart
Consider a committee which must select one alternative from a set of three or more alternatives. Committee members each cast a ballot which the voting procedure counts. The voting procedure is strategyproof if it always induces every committee member to cast a ballot revealing his preference. I
KodairaSpencer theory of gravity and exact results for quantum string amplitudes
 Commun. Math. Phys
, 1994
"... We develop techniques to compute higher loop string amplitudes for twisted N = 2 theories with ĉ = 3 (i.e. the critical case). An important ingredient is the discovery of an anomaly at every genus in decoupling of BRST trivial states, captured to all orders by a master anomaly equation. In a particu ..."
Abstract

Cited by 545 (60 self)
 Add to MetaCart
We develop techniques to compute higher loop string amplitudes for twisted N = 2 theories with ĉ = 3 (i.e. the critical case). An important ingredient is the discovery of an anomaly at every genus in decoupling of BRST trivial states, captured to all orders by a master anomaly equation. In a
Books in graphs
, 2008
"... A set of q triangles sharing a common edge is called a book of size q. We write β (n, m) for the the maximal q such that every graph G (n, m) contains a book of size q. In this note 1) we compute β ( n, cn 2) for infinitely many values of c with 1/4 < c < 1/3, 2) we show that if m ≥ (1/4 − α) ..."
Abstract

Cited by 2380 (22 self)
 Add to MetaCart
A set of q triangles sharing a common edge is called a book of size q. We write β (n, m) for the the maximal q such that every graph G (n, m) contains a book of size q. In this note 1) we compute β ( n, cn 2) for infinitely many values of c with 1/4 < c < 1/3, 2) we show that if m ≥ (1/4 − α
The irreducibility of the space of curves of given genus
 Publ. Math. IHES
, 1969
"... Fix an algebraically closed field k. Let Mg be the moduli space of curves of genus g over k. The main result of this note is that Mg is irreducible for every k. Of course, whether or not M s is irreducible depends only on the characteristic of k. When the characteristic s o, we can assume that k ~ ..."
Abstract

Cited by 512 (2 self)
 Add to MetaCart
~ (1, and then the result is classical. A simple proof appears in EnriquesChisini [E, vol. 3, chap. 3], based on analyzing the totality of coverings of p1 of degree n, with a fixed number d of ordinary branch points. This method has been extended to char. p by William Fulton [F], using specializations
Sprite: A Simple, CheatProof, CreditBased System for Mobile AdHoc Networks
 in Proceedings of IEEE INFOCOM
, 2002
"... Mobile ad hoc networking has been an active research area for several years. How to stimulate cooperation among selfish mobile nodes, however, is not well addressed yet. In this paper, we propose Sprite, a simple, cheatproof, creditbased system for stimulating cooperation among selfish nodes in mob ..."
Abstract

Cited by 473 (18 self)
 Add to MetaCart
Mobile ad hoc networking has been an active research area for several years. How to stimulate cooperation among selfish mobile nodes, however, is not well addressed yet. In this paper, we propose Sprite, a simple, cheatproof, creditbased system for stimulating cooperation among selfish nodes
A Framework for Defining Logics
 JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY
, 1993
"... The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed calculus with dependent types. Syntax is treated in a style similar to, but more general than, MartinLof's system of ariti ..."
Abstract

Cited by 807 (45 self)
 Add to MetaCart
The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed calculus with dependent types. Syntax is treated in a style similar to, but more general than, MartinLof's system
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 682 (6 self)
 Add to MetaCart
(MD), which has been widely used in the past for studying simple liquids and solids, has more recently been applied to molecular systems with internal degrees of freedom such as N, [l], H,O [2] and even C,H,, [3]. In applying the MD method three problems arise: (a) the choice of a suitable mechanical
Powerlaw distributions in empirical data
 ISSN 00361445. doi: 10.1137/ 070710111. URL http://dx.doi.org/10.1137/070710111
, 2009
"... Powerlaw distributions occur in many situations of scientific interest and have significant consequences for our understanding of natural and manmade phenomena. Unfortunately, the empirical detection and characterization of power laws is made difficult by the large fluctuations that occur in the t ..."
Abstract

Cited by 589 (7 self)
 Add to MetaCart
demonstrate these methods by applying them to twentyfour realworld data sets from a range of different disciplines. Each of the data sets has been conjectured previously to follow a powerlaw distribution. In some cases we find these conjectures to be consistent with the data while in others the power law
Nonmonotonic Reasoning, Preferential Models and Cumulative Logics
, 1990
"... Many systems that exhibit nonmonotonic behavior have been described and studied already in the literature. The general notion of nonmonotonic reasoning, though, has almost always been described only negatively, by the property it does not enjoy, i.e. monotonicity. We study here general patterns of ..."
Abstract

Cited by 624 (14 self)
 Add to MetaCart
of nonmonotonic reasoning and try to isolate properties that could help us map the field of nonmonotonic reasoning by reference to positive properties. We concentrate on a number of families of nonmonotonic consequence relations, defined in the style of Gentzen [13]. Both prooftheoretic and semantic points
A Morphable Model For The Synthesis Of 3D Faces
, 1999
"... In this paper, a new technique for modeling textured 3D faces is introduced. 3D faces can either be generated automatically from one or more photographs, or modeled directly through an intuitive user interface. Users are assisted in two key problems of computer aided face modeling. First, new face i ..."
Abstract

Cited by 1084 (55 self)
 Add to MetaCart
In this paper, a new technique for modeling textured 3D faces is introduced. 3D faces can either be generated automatically from one or more photographs, or modeled directly through an intuitive user interface. Users are assisted in two key problems of computer aided face modeling. First, new face
Results 1  10
of
4,178,807