221 search results - page 1 / 45 » On Approximating the Radii of Point Sets in High Dimensions |
94
Voted
FOCS
2002
IEEE
15 years 6 months ago
2002
IEEE
179
click to vote
CORR
1999
Springer
15 years 1 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
130
Voted
STOC
2006
ACM
16 years 2 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
103
Voted
CCCG
2006
15 years 3 months ago
2006
We analyze an extremely simple approximation algorithm for computing the minimum enclosing ball (or the 1-center) of a set of points in high dimensions. We prove that this algorit...
118
click to vote
ESA
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...