Sciweavers

312 search results - page 53 / 63
» On distance and similarity in fold space
Sort
View
CVPR
2012
IEEE
12 years 12 months ago
Spherical hashing
Many binary code encoding schemes based on hashing have been actively studied recently, since they can provide efficient similarity search, especially nearest neighbor search, an...
Jae-Pil Heo, Youngwoon Lee, Junfeng He, Shih-Fu Ch...
ECCV
2004
Springer
15 years 11 months ago
Transformation-Invariant Embedding for Image Analysis
Abstract. Dimensionality reduction is an essential aspect of visual processing. Traditionally, linear dimensionality reduction techniques such as principle components analysis have...
Ali Ghodsi, Jiayuan Huang, Dale Schuurmans
BTW
2007
Springer
183views Database» more  BTW 2007»
15 years 1 months ago
Efficient Reverse k-Nearest Neighbor Estimation
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...
Elke Achtert, Christian Böhm, Peer Kröge...
CORR
2007
Springer
122views Education» more  CORR 2007»
14 years 9 months ago
How to Complete a Doubling Metric
In recent years, considerable advances have been made in the study of properties of metric spaces in terms of their doubling dimension. This line of research has not only enhanced...
Anupam Gupta, Kunal Talwar
FOCS
2008
IEEE
15 years 3 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder