221 search results - page 3 / 45 » On Approximating the Radii of Point Sets in High Dimensions |
140
click to vote
CCCG
2009
15 years 7 months ago
2009
Given a set of blue points and a set of red points in ddimensional space, we show how to find an axis-aligned hyperrectangle that contains no red points and as many blue points as...
157
click to vote
ALENEX
2004
15 years 8 months ago
2004
Given a terrain T and a point p on or above it, we wish to compute the region Rp that is visible from p. We present a generic radar-like algorithm for computing an approximation o...
198
click to vote
CVPR
2010
IEEE
15 years 5 months ago
2010
IEEE
We examine the problem of large scale nearest neighbor search in high dimensional spaces and propose a new approach based on the close relationship between nearest neighbor search...
176
click to vote
ISAAC
2004
Springer
16 years 1 days ago
2004
Springer
Abstract. We study the problem of maintaining a (1+ )-factor approximation of the diameter of a stream of points under the sliding window model. In one dimension, we give a simple ...
161
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Let us assume that f is a continuous function defined on the unit ball of Rd , of the form f(x) = g(Ax), where A is a k×d matrix and g is a function of k variables for k ≪ d. ...