Locality-sensitive hashing (LSH) reduces the dimensionality of high-dimensional data. LSH hashes input items so that similar items map to the same… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Anne Driemel, Francesco Silvestri
- Symposium on Computational Geometry
- 2017

We study data structures for storing a set of polygonal curves in IR such that, given a query curve, we can efficiently retrieve… (More)

Is this relevant?

Highly Cited

2014

Highly Cited

2014

We present a new data structure for the c-approximate near neighbor problem (ANN) in the Euclidean space. For n points in R, our… (More)

Is this relevant?

Highly Cited

2012

Highly Cited

2012

- Brian Kulis, Kristen Grauman
- IEEE Transactions on Pattern Analysis and Machine…
- 2012

Fast retrieval methods are critical for many large-scale and data-driven vision applications. Recent work has explored ways to… (More)

Is this relevant?

2012

2012

- David Gorisse, Matthieu Cord, Frédéric Precioso
- IEEE Transactions on Pattern Analysis and Machine…
- 2012

In the past 10 years, new powerful algorithms based on efficient data structures have been proposed to solve the problem of… (More)

Is this relevant?

2011

2011

- Anirban Dasgupta, Ravi Kumar, Tamás Sarlós
- KDD
- 2011

Locality-sensitive hashing (LSH) is a basic primitive in several large-scale data processing applications, including nearest… (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- Brian Kulis, Kristen Grauman
- 2009 IEEE 12th International Conference on…
- 2009

Fast retrieval methods are critical for large-scale and data-driven vision applications. Recent work has explored ways to embed… (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- Alexis Joly, Olivier Buisson
- ACM Multimedia
- 2008

Efficient high-dimensional similarity search structures are essential for building scalable content-based search systems on… (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- Rajeev Motwani, Assaf Naor, Rina Panigrahy
- Symposium on Computational Geometry
- 2006

Given a metric space <i>(X,d<sub>X</sub>)</i>, <i>c</i>≥1, <i>r</i>>0, and <i>p,q</i> ≡ [0,1], a distribution over… (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Mayur Datar, Nicole Immorlica, Piotr Indyk, Vahab S. Mirrokni
- Symposium on Computational Geometry
- 2004

We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under <i>l</i><sub>p</sub> norm… (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- Jeremy Buhler
- Bioinformatics
- 2001

MOTIVATION
Comparison of multimegabase genomic DNA sequences is a popular technique for finding and annotating conserved genome… (More)

Is this relevant?