141 search results - page 23 / 29 » Self-improving Algorithms for Convex Hulls |
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
A geometric and non parametric procedure for testing if two nite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that deter...
126
Voted
VLSISP
2010
14 years 7 months ago
2010
Abstract In case of insufficient data samples in highdimensional classification problems, sparse scatters of samples tend to have many ‘holes’—regions that have few or no nea...
169
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
Given a set of points P and a query point q, the reverse furthest neighbor (RFN) query fetches the set of points p P such that q is their furthest neighbor among all points in P {...
GMP
2006
IEEE
15 years 3 months ago
2006
IEEE
Abstract. The need for robust solutions for sets of non-linear multivariate constraints or equations needs no motivation. Subdivision-based multivariate constraint solvers [1–3] ...
COMPGEOM
2004
ACM
15 years 2 months ago
2004
ACM
Given a set of n points S in the plane, a triangulation of S is a subdivision of the convex hull into triangles whose vertices are from S. In the kinetic setting, the input point ...