Results 1  10
of
94,723
Local overlaps in special unfoldings of convex polyhedra
 In Proc. 18th Canad. Conf. Comput. Geom
, 2006
"... We define a notion of local overlaps in polyhedron unfoldings. We use this concept to construct convex polyhedra for which certain classes of edge unfoldings contain overlaps, thereby negatively resolving some open conjectures. In particular, we construct a convex polyhedron for which every shortest ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We define a notion of local overlaps in polyhedron unfoldings. We use this concept to construct convex polyhedra for which certain classes of edge unfoldings contain overlaps, thereby negatively resolving some open conjectures. In particular, we construct a convex polyhedron for which every
Convex Analysis
, 1970
"... In this book we aim to present, in a unified framework, a broad spectrum of mathematical theory that has grown in connection with the study of problems of optimization, equilibrium, control, and stability of linear and nonlinear systems. The title Variational Analysis reflects this breadth. For a lo ..."
Abstract

Cited by 5350 (67 self)
 Add to MetaCart
In this book we aim to present, in a unified framework, a broad spectrum of mathematical theory that has grown in connection with the study of problems of optimization, equilibrium, control, and stability of linear and nonlinear systems. The title Variational Analysis reflects this breadth. For a long time, ‘variational ’ problems have been identified mostly with the ‘calculus of variations’. In that venerable subject, built around the minimization of integral functionals, constraints were relatively simple and much of the focus was on infinitedimensional function spaces. A major theme was the exploration of variations around a point, within the bounds imposed by the constraints, in order to help characterize solutions and portray them in terms of ‘variational principles’. Notions of perturbation, approximation and even generalized differentiability were extensively investigated. Variational theory progressed also to the study of socalled stationary points, critical points, and other indications of singularity that a point might have relative to its neighbors, especially in association with existence theorems for differential equations.
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 by a Newton polyhedron ∆ consists of (n − 1)dimensional CalabiYau varieties then the dual, or polar, polyhedron ∆ ∗ in the dual space defines another family F( ∆ ∗ ) of CalabiYau varieties, so that we obtain the remarkable duality between two different families of CalabiYau varieties. It is shown that the properties of this duality coincide with the properties of Mirror Symmetry discovered by physicists for CalabiYau 3folds. Our method allows to construct many new examples of CalabiYau 3folds and new candidates for their mirrors which were previously unknown for physicists. We conjecture that there exists an isomorphism between two conformal field theories corresponding to CalabiYau varieties from two families F(∆) and F( ∆ ∗). 1
Incorporating nonlocal information into information extraction systems by gibbs sampling
 In ACL
, 2005
"... Most current statistical natural language processing models use only local features so as to permit dynamic programming in inference, but this makes them unable to fully account for the long distance structure that is prevalent in language use. We show how to solve this dilemma with Gibbs sampling, ..."
Abstract

Cited by 696 (25 self)
 Add to MetaCart
Most current statistical natural language processing models use only local features so as to permit dynamic programming in inference, but this makes them unable to fully account for the long distance structure that is prevalent in language use. We show how to solve this dilemma with Gibbs sampling
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
 SIAM Journal on Optimization
, 1993
"... We study the semidefinite programming problem (SDP), i.e the problem of optimization of a linear function of a symmetric matrix subject to linear equality constraints and the additional condition that the matrix be positive semidefinite. First we review the classical cone duality as specialized to S ..."
Abstract

Cited by 557 (12 self)
 Add to MetaCart
We study the semidefinite programming problem (SDP), i.e the problem of optimization of a linear function of a symmetric matrix subject to linear equality constraints and the additional condition that the matrix be positive semidefinite. First we review the classical cone duality as specialized
Spiral Unfoldings of Convex Polyhedra
, 2015
"... The notion of a spiral unfolding of a convex polyhedron, a special type of Hamiltonian cutpath, is explored. The Platonic and Archimedian solids all have nonoverlapping spiral unfoldings, although overlap is more the rule than the exception among generic polyhedra. The structure of spiral unfolding ..."
Abstract
 Add to MetaCart
The notion of a spiral unfolding of a convex polyhedron, a special type of Hamiltonian cutpath, is explored. The Platonic and Archimedian solids all have nonoverlapping spiral unfoldings, although overlap is more the rule than the exception among generic polyhedra. The structure of spiral
Discriminative Training and Maximum Entropy Models for Statistical Machine Translation
, 2002
"... We present a framework for statistical machine translation of natural languages based on direct maximum entropy models, which contains the widely used source channel approach as a special case. All knowledge sources are treated as feature functions, which depend on the source language senten ..."
Abstract

Cited by 497 (30 self)
 Add to MetaCart
We present a framework for statistical machine translation of natural languages based on direct maximum entropy models, which contains the widely used source channel approach as a special case. All knowledge sources are treated as feature functions, which depend on the source language
Region Competition: Unifying Snakes, Region Growing, and Bayes/MDL for Multiband Image Segmentation
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1996
"... We present a novel statistical and variational approach to image segmentation based on a new algorithm named region competition. This algorithm is derived by minimizing a generalized Bayes/MDL criterion using the variational principle. The algorithm is guaranteed to converge to a local minimum and c ..."
Abstract

Cited by 778 (21 self)
 Add to MetaCart
We present a novel statistical and variational approach to image segmentation based on a new algorithm named region competition. This algorithm is derived by minimizing a generalized Bayes/MDL criterion using the variational principle. The algorithm is guaranteed to converge to a local minimum
A solution to Plato’s problem: The latent semantic analysis theory of acquisition, induction, and representation of knowledge
 PSYCHOLOGICAL REVIEW
, 1997
"... How do people know as much as they do with as little information as they get? The problem takes many forms; learning vocabulary from text is an especially dramatic and convenient case for research. A new general theory of acquired similarity and knowledge representation, latent semantic analysis (LS ..."
Abstract

Cited by 1772 (10 self)
 Add to MetaCart
(LSA), is presented and used to successfully simulate such learning and several other psycholinguistic phenomena. By inducing global knowledge indirectly from local cooccurrence data in a large body of representative text, LSA acquired knowledge about the full vocabulary of English at a comparable
Results 1  10
of
94,723