Sciweavers

10 search results - page 2 / 2
» Approximate Nearest Neighbors: Towards Removing the Curse of...
Sort
View
TKDE
2011
332views more  TKDE 2011»
13 years 5 months ago
Adaptive Cluster Distance Bounding for High-Dimensional Indexing
—We consider approaches for similarity search in correlated, high-dimensional data-sets, which are derived within a clustering framework. We note that indexing by “vector appro...
Sharadh Ramaswamy, Kenneth Rose
SSDBM
2009
IEEE
192views Database» more  SSDBM 2009»
14 years 5 months ago
MLR-Index: An Index Structure for Fast and Scalable Similarity Search in High Dimensions
High-dimensional indexing has been very popularly used for performing similarity search over various data types such as multimedia (audio/image/video) databases, document collectio...
Rahul Malik, Sangkyum Kim, Xin Jin, Chandrasekar R...
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
14 years 3 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
VLDB
1999
ACM
118views Database» more  VLDB 1999»
14 years 3 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
SCALESPACE
2007
Springer
14 years 5 months ago
Towards Segmentation Based on a Shape Prior Manifold
Incorporating shape priors in image segmentation has become a key problem in computer vision. Most existing work is limited to a linearized shape space with small deformation modes...
Patrick Etyngier, Renaud Keriven, Jean-Philippe Po...