Results 1  10
of
70,639
Homological Algebra of Mirror Symmetry
 in Proceedings of the International Congress of Mathematicians
, 1994
"... Mirror Symmetry was discovered several years ago in string theory as a duality between families of 3dimensional CalabiYau manifolds (more precisely, complex algebraic manifolds possessing holomorphic volume elements without zeroes). The name comes from the symmetry among Hodge numbers. For dual Ca ..."
Abstract

Cited by 523 (3 self)
 Add to MetaCart
Mirror Symmetry was discovered several years ago in string theory as a duality between families of 3dimensional CalabiYau manifolds (more precisely, complex algebraic manifolds possessing holomorphic volume elements without zeroes). The name comes from the symmetry among Hodge numbers. For dual
Dual polyhedra and mirror symmetry for Calabi–Yau hypersurfaces in toric varieties
 J. Alg. Geom
, 1994
"... We consider families F(∆) consisting of complex (n − 1)dimensional projective algebraic compactifications of ∆regular affine hypersurfaces Zf defined by Laurent polynomials f with a fixed ndimensional Newton polyhedron ∆ in ndimensional algebraic torus T = (C ∗ ) n. If the family F(∆) defined by ..."
Abstract

Cited by 467 (20 self)
 Add to MetaCart
We consider families F(∆) consisting of complex (n − 1)dimensional projective algebraic compactifications of ∆regular affine hypersurfaces Zf defined by Laurent polynomials f with a fixed ndimensional Newton polyhedron ∆ in ndimensional algebraic torus T = (C ∗ ) n. If the family F(∆) defined
The Conjecture
, 2008
"... Conjecture (Schanuel): Let x1,..., xn be Qlinearly independent complex numbers. Then the transcendence degree over Q of the field Q(x1,..., xn, e x1,..., e xn) is at least n. ..."
Abstract
 Add to MetaCart
Conjecture (Schanuel): Let x1,..., xn be Qlinearly independent complex numbers. Then the transcendence degree over Q of the field Q(x1,..., xn, e x1,..., e xn) is at least n.
A Critique of Software Defect Prediction Models
 IEEE TRANSACTIONS ON SOFTWARE ENGINEERING
, 1999
"... Many organizations want to predict the number of defects (faults) in software systems, before they are deployed, to gauge the likely delivered quality and maintenance effort. To help in this numerous software metrics and statistical models have been developed, with a correspondingly large literatur ..."
Abstract

Cited by 292 (21 self)
 Add to MetaCart
literature. We provide a critical review of this literature and the stateoftheart. Most of the wide range of prediction models use size and complexity metrics to predict defects. Others are based on testing data, the “quality ” of the development process, or take a multivariate approach. The authors
Lovász Conjecture and Homcomplexes
, 2008
"... 2.1 Graph coloring.......................... 6 3 A topological angle 9 ..."
Probabilistic Algorithms in Robotics
 AI Magazine vol
"... This article describes a methodology for programming robots known as probabilistic robotics. The probabilistic paradigm pays tribute to the inherent uncertainty in robot perception, relying on explicit representations of uncertainty when determining what to do. This article surveys some of the progr ..."
Abstract

Cited by 199 (6 self)
 Add to MetaCart
of the progress in the field, using indepth examples to illustrate some of the nuts and bolts of the basic approach. Our central conjecture is that the probabilistic approach to robotics scales better to complex realworld applications than approaches that ignore a robot’s uncertainty. 1
Complexity measures for publickey cryptosystems
 SIAM Journal on Computing
, 1988
"... The first part of this paper gives results about promise problems. A "promise problem " is a formulation of a partial decision problem that is useful for describing cracking problems for publickey cryptosystems (PKCS). We prove that every NPhard promise problem is uniformly NPhard ..."
Abstract

Cited by 148 (15 self)
 Add to MetaCart
hard, and we show that a number of results and a conjecture about promise problems are equivalent to separability assertions that are the natural analogues of wellknown results in classical recursion theory. The conjecture, if it is true, implies nonexistence of PKCS having NPhard cracking problems
Theoretical Risks and Tabular Asterisks: Sir Karl and Sir Ronald and The Slow progress OF SOFT PSYCHOLOGY
 J CONSULTING AND CLINICAL PSYCHOLOGY
, 1978
"... Theories in “soft” areas of psychology lack the cumulative character of scientific knowledge. They tend neither to be refuted nor corroborated, but instead merely fade away as people lose interest. Even though intrinsic subject matter difficulties (20 listed) contribute to this, the excessive relian ..."
Abstract

Cited by 205 (13 self)
 Add to MetaCart
complex, causally uninterpretable outcomes of statistical power functions. Multiple paths to estimating numerical point values (“consistency tests”) are better, even if approximate with rough tolerances; and lacking this, ranges, orderings, secondorder differences, curve peaks and valleys, and function
The GL2 main conjecture for elliptic curves without complex multiplication
 Publ. I.H.E.S. 101 (2005
"... The main conjectures of Iwasawa theory provide the only general method known at present for studying the mysterious relationship between purely arithmetic problems and the special values of complex Lfunctions, typified by the conjecture of Birch and Swinnerton ..."
Abstract

Cited by 70 (14 self)
 Add to MetaCart
The main conjectures of Iwasawa theory provide the only general method known at present for studying the mysterious relationship between purely arithmetic problems and the special values of complex Lfunctions, typified by the conjecture of Birch and Swinnerton
The Hodge Conjecture
"... dean space C because the complex numbers C can be identified with the real plane R , any complex manifold is automatically a smooth manifold. If a manifold M looks locally like C , we say that it has complex dimension n, and real dimension 2n. For example, the sphere and the torus are both ..."
Abstract
 Add to MetaCart
dean space C because the complex numbers C can be identified with the real plane R , any complex manifold is automatically a smooth manifold. If a manifold M looks locally like C , we say that it has complex dimension n, and real dimension 2n. For example, the sphere and the torus
Results 1  10
of
70,639