458 search results - page 53 / 92 » Linear Time Algorithms for Clustering Problems in Any Dimens... |
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
COMPGEOM
2005
ACM
13 years 10 months ago
2005
ACM
Star splaying is a general-dimensional algorithm that takes as input a triangulation or an approximation of a convex hull, and produces the Delaunay triangulation, weighted Delaun...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. We propose and analyze a new vantage point for the learning of mixtures of Gaussians: namely, the PAC-style model of learning probability distributions introduced by Kear...
SCN
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Lattice reduction is known to be a very powerful tool in modern cryptanalysis. In the literature, there are many lattice reduction algorithms that have been proposed with...
SIGCOMM
2010
ACM
13 years 8 months ago
2010
ACM
Energy consumption is a major and costly problem in data centers. A large fraction of this energy goes to powering idle machines that are not doing any useful work. We identify tw...