Results 1  10
of
157,764
Exact Primitives for Smallest Enclosing Ellipses ¤
"... The problem of ¯nding the unique closed ellipsoid of smallest volume enclosing an npoint set P in dspace (known as the LÄownerJohn ellipsoid of P [5]) is an instance of convex programming and can be solved by general methods in time ..."
Abstract
 Add to MetaCart
The problem of ¯nding the unique closed ellipsoid of smallest volume enclosing an npoint set P in dspace (known as the LÄownerJohn ellipsoid of P [5]) is an instance of convex programming and can be solved by general methods in time
Exact Primitives for Smallest Enclosing Ellipses
 In Proc. 13th Annu. ACM Symp. on Computational Geometry
, 1997
"... The problem of finding the unique closed ellipsoid of smallest volume enclosing an npoint set P in dspace (known as the LoewnerJohn ellipsoid of P) is an instance of convex programming and can be solved by general methods in time O(n) if the dimension is fixed. The problemspecific parts of these ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
The problem of finding the unique closed ellipsoid of smallest volume enclosing an npoint set P in dspace (known as the LoewnerJohn ellipsoid of P) is an instance of convex programming and can be solved by general methods in time O(n) if the dimension is fixed. The problemspecific parts
Smallest Enclosing Ellipses  Fast and Exact
, 1997
"... The problem of finding the smallest enclosing ellipsoid of an npoint set P in dspace is an instance of convex programming and can be solved by general methods in time O(n) if the dimension is fixed. The problemspecific parts of these methods are encapsulated in primitive operations that deal wit ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
The problem of finding the smallest enclosing ellipsoid of an npoint set P in dspace is an instance of convex programming and can be solved by general methods in time O(n) if the dimension is fixed. The problemspecific parts of these methods are encapsulated in primitive operations that deal
Smallest Enclosing Ellipses  An Exact and Generic Implementation in C++
, 1998
"... We present a C++ implementation of an optimisation algorithm for computing the smallest (w.r.t. area) enclosing ellipse of a finite point set in the plane. We obtain an exact solution by using Welzl's method [14] together with the primitives as described in [6, 7]. The algorithm is implemented ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present a C++ implementation of an optimisation algorithm for computing the smallest (w.r.t. area) enclosing ellipse of a finite point set in the plane. We obtain an exact solution by using Welzl's method [14] together with the primitives as described in [6, 7]. The algorithm is implemented
Primitives for the manipulation of general subdivisions and the computations of Voronoi diagrams
 ACM Tmns. Graph
, 1985
"... The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms ar ..."
Abstract

Cited by 543 (11 self)
 Add to MetaCart
to the separation of the geometrical and topological aspects of the problem and to the use of two simple but powerful primitives, a geometric predicate and an operator for manipulating the topology of the diagram. The topology is represented by a new data structure for generalized diagrams, that is, embeddings
Direct least Square Fitting of Ellipses
, 1998
"... This work presents a new efficient method for fitting ellipses to scattered data. Previous algorithms either fitted general conics or were computationally expensive. By minimizing the algebraic distance subject to the constraint 4ac  b² = 1 the new method incorporates the ellipticity constraint ..."
Abstract

Cited by 421 (3 self)
 Add to MetaCart
This work presents a new efficient method for fitting ellipses to scattered data. Previous algorithms either fitted general conics or were computationally expensive. By minimizing the algebraic distance subject to the constraint 4ac  b² = 1 the new method incorporates the ellipticity constraint
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 particular realization of the N = 2 theories, the resulting string field theory is equivalent to a topological theory in six dimensions, the Kodaira– Spencer theory, which may be viewed as the closed string analog of the Chern–Simon theory. Using the mirror map this leads to computation of the ‘number ’ of holomorphic curves of higher genus curves in Calabi–Yau manifolds. It is shown that topological amplitudes can also be reinterpreted as computing corrections to superpotential terms appearing in the effective 4d theory resulting from compactification of standard 10d superstrings on the corresponding N = 2 theory. Relations with c = 1 strings are also pointed out.
Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. Technical Report 2003/235, Cryptology ePrint archive, http://eprint.iacr.org, 2006. Previous version appeared at EUROCRYPT 2004
 34 [DRS07] [DS05] [EHMS00] [FJ01] Yevgeniy Dodis, Leonid Reyzin, and Adam
, 2004
"... We provide formal definitions and efficient secure techniques for • turning noisy information into keys usable for any cryptographic application, and, in particular, • reliably and securely authenticating biometric data. Our techniques apply not just to biometric information, but to any keying mater ..."
Abstract

Cited by 532 (38 self)
 Add to MetaCart
material that, unlike traditional cryptographic keys, is (1) not reproducible precisely and (2) not distributed uniformly. We propose two primitives: a fuzzy extractor reliably extracts nearly uniform randomness R from its input; the extraction is errortolerant in the sense that R will be the same even
Bandera: Extracting Finitestate Models from Java Source Code
 IN PROCEEDINGS OF THE 22ND INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING
, 2000
"... Finitestate verification techniques, such as model checking, have shown promise as a costeffective means for finding defects in hardware designs. To date, the application of these techniques to software has been hindered by several obstacles. Chief among these is the problem of constructing a fini ..."
Abstract

Cited by 653 (35 self)
 Add to MetaCart
finitestate model that approximates the executable behavior of the software system of interest. Current bestpractice involves handconstruction of models which is expensive (prohibitive for all but the smallest systems), prone to errors (which can result in misleading verification results
Factor Graphs and the SumProduct Algorithm
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 1998
"... A factor graph is a bipartite graph that expresses how a "global" function of many variables factors into a product of "local" functions. Factor graphs subsume many other graphical models including Bayesian networks, Markov random fields, and Tanner graphs. Following one simple c ..."
Abstract

Cited by 1787 (72 self)
 Add to MetaCart
computational rule, the sumproduct algorithm operates in factor graphs to computeeither exactly or approximatelyvarious marginal functions by distributed messagepassing in the graph. A wide variety of algorithms developed in artificial intelligence, signal processing, and digital communications can
Results 1  10
of
157,764