221 search results - page 10 / 45 » On Approximating the Radii of Point Sets in High Dimensions |
STOC
1998
ACM
13 years 12 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
PODS
2000
ACM
13 years 11 months ago
2000
ACM
In this paper, we propose a new tunable index scheme, called iMinMax , that maps points in high dimensional spaces to single dimension values determined by their maximum or minimu...
TVCG
2010
13 years 6 months ago
2010
—A (3D) scalar grid is a regular n1 × n2 × n3 grid of vertices where each vertex v is associated with some scalar value sv. Applying trilinear interpolation, the scalar grid de...
STOC
2002
ACM
14 years 8 months ago
2002
ACM
In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering effici...
JGTOOLS
2006
13 years 7 months ago
2006
We present a graphics hardware implementation of the tangent-plane algorithm for computing the kth-order Voronoi diagram of a set of point sites in image space. Correct and effici...