307 search results - page 19 / 62 » The convex hull of ellipsoids |
VLDB
2002
ACM
14 years 11 months ago
2002
ACM
Many modern database applications require content-based similarity search capability in numeric attribute space. Further, users' notion of similarity varies between search se...
DAGM
2007
Springer
15 years 6 months ago
2007
Springer
We propose an unsupervised “local learning” algorithm for learning a metric in the input space. Geometrically, for a given query point, the algorithm finds the minimum volume ...
AUTOMATICA
2004
14 years 11 months ago
2004
In this paper, we discuss semidefinite relaxation techniques for computing minimal size ellipsoids that bound the solution set of a system of uncertain linear equations. The propo...
DGCI
2008
Springer
15 years 1 months ago
2008
Springer
Based on a classical convex hull algorithm called Gift-Wrapping, the purpose of the paper is to provide a new algorithm for computing the vertices of a polytope called preimage - ...
103
click to vote
ORL
2011
14 years 6 months ago
2011
The Chv´atal-Gomory closure and the split closure of a rational polyhedron are rational polyhedra. It was recently shown that the Chv´atal-Gomory closure of a strictly convex bo...