Sciweavers

134 search results - page 27 / 27
» Approximate Nearest Neighbor Queries in Fixed Dimensions
Sort
View
SODA
2010
ACM
704views Algorithms» more  SODA 2010»
14 years 2 months ago
A locality-sensitive hash for real vectors
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 ...
Tyler Neylon
SWAP
2008
13 years 6 months ago
A Note on the Evaluation of Inductive Concept Classification Procedures
Abstract. The limitations of deductive logic-based approaches at deriving operational knowledge from ontologies may be overcome by inductive (instancebased) methods, which are usua...
Claudia d'Amato, Nicola Fanizzi, Floriana Esposito
PAMI
2006
132views more  PAMI 2006»
13 years 5 months ago
Rapid Object Indexing Using Locality Sensitive Hashing and Joint 3D-Signature Space Estimation
We propose a new method for rapid 3D object indexing that combines feature-based methods with coarse alignment-based matching techniques. Our approach achieves a sublinear complexi...
Bogdan Matei, Ying Shan, Harpreet S. Sawhney, Yi T...
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
14 years 5 months ago
Gowers uniformity, influence of variables, and PCPs
Gowers [Gow98, Gow01] introduced, for d 1, the notion of dimension-d uniformity Ud (f) of a function f : G C, where G is a finite abelian group. Roughly speaking, if a function ...
Alex Samorodnitsky, Luca Trevisan