Sciweavers

221 search results - page 6 / 45
» On Approximating the Radii of Point Sets in High Dimensions
Sort
View
VLDB
1999
ACM
118views Database» more  VLDB 1999»
13 years 12 months ago
Similarity Search in High Dimensions via Hashing
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
Aristides Gionis, Piotr Indyk, Rajeev Motwani
COMPGEOM
1993
ACM
13 years 11 months ago
Approximating Center Points with Iterated Radon Points
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
Kenneth L. Clarkson, David Eppstein, Gary L. Mille...
CCCG
2003
13 years 9 months ago
The Gaussian Centre of a Set of Mobile Points
Abstract Steph Durocher∗ and David Kirkpatrick† Department of Computer Science, University of British Columbia Vancouver BC, Canada Given a set of client positions as input, f...
Stephane Durocher, David G. Kirkpatrick
NA
2007
100views more  NA 2007»
13 years 7 months ago
Periodization strategy may fail in high dimensions
Abstract. We discuss periodization of smooth functions f of d variables for approximation of multivariate integrals. The benefit of periodization is that we may use lattice rules,...
Frances Y. Kuo, Ian H. Sloan, Henryk Wozniakowski
FOCS
2008
IEEE
14 years 2 months ago
Spherical Cubes and Rounding in High Dimensions
What is the least surface area of a shape that tiles Rd under translations by Zd ? Any such shape must have volume 1 and hence surface area at least that of the volume-1 ball, nam...
Guy Kindler, Ryan O'Donnell, Anup Rao, Avi Wigders...