Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,568,304 papers from all fields of science
Search
Sign In
Create Free Account
Locality-sensitive hashing
Known as:
LSH
, Locality Sensitive Hashing
Locality-sensitive hashing (LSH) reduces the dimensionality of high-dimensional data. LSH hashes input items so that similar items map to the same…
Expand
Wikipedia
Create Alert
Alert
Related topics
Related topics
33 relations
Andrei Broder
Anti-spam techniques
Approximate string matching
Bag-of-words model in computer vision
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Locality-Sensitive Hashing of Curves
A. Driemel
,
Francesco Silvestri
SoCG
2017
Corpus ID: 1086371
We study data structures for storing a set of polygonal curves in R^d such that, given a query curve, we can efficiently retrieve…
Expand
Highly Cited
2014
Highly Cited
2014
Beyond Locality-Sensitive Hashing
Alexandr Andoni
,
P. Indyk
,
Huy L. Nguyen
,
Ilya P. Razenshteyn
SODA
2014
Corpus ID: 1234761
We present a new data structure for the c-approximate near neighbor problem (ANN) in the Euclidean space. For n points in Rd, our…
Expand
Highly Cited
2012
Highly Cited
2012
Efficient distributed locality sensitive hashing
B. Bahmani
,
Ashish Goel
,
Rajendra Shinde
CIKM
2012
Corpus ID: 1632557
Distributed frameworks are gaining increasingly widespread use in applications that process large amounts of data. One important…
Expand
Highly Cited
2012
Highly Cited
2012
Super-Bit Locality-Sensitive Hashing
Jianqiu Ji
,
Jianmin Li
,
Shuicheng Yan
,
Bo Zhang
,
Q. Tian
NIPS
2012
Corpus ID: 6107054
Sign-random-projection locality-sensitive hashing (SRP-LSH) is a probabilistic dimension reduction method which provides an…
Expand
Highly Cited
2011
Highly Cited
2011
Fast locality-sensitive hashing
Anirban Dasgupta
,
Ravi Kumar
,
Tamás Sarlós
KDD
2011
Corpus ID: 207189733
Locality-sensitive hashing (LSH) is a basic primitive in several large-scale data processing applications, including nearest…
Expand
Highly Cited
2009
Highly Cited
2009
Kernelized locality-sensitive hashing for scalable image search
B. Kulis
,
K. Grauman
IEEE 12th International Conference on Computer…
2009
Corpus ID: 7201154
Fast retrieval methods are critical for large-scale and data-driven vision applications. Recent work has explored ways to embed…
Expand
Highly Cited
2008
Highly Cited
2008
Locality-Sensitive Hashing for Finding Nearest Neighbors [Lecture Notes]
M. Slaney
,
M. Casey
IEEE Signal Processing Magazine
2008
Corpus ID: 7844109
This lecture note describes a technique known as locality-sensitive hashing (LSH) that allows one to quickly find similar entries…
Expand
Highly Cited
2008
Highly Cited
2008
Locality-Sensitive Hashing for Finding Nearest Neighbors
M. Slaney
,
M. Casey
2008
Corpus ID: 62141681
1053-5888/08/$20.00©2008IEEE IEEE SIGNAL PROCESSING MAGAZINE [128] MARCH 2008 T he Internet has brought us a wealth of data, all…
Expand
Highly Cited
2004
Highly Cited
2004
Locality-sensitive hashing scheme based on p-stable distributions
Mayur Datar
,
Nicole Immorlica
,
P. Indyk
,
V. Mirrokni
SCG '04
2004
Corpus ID: 747083
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under lp norm, based on p…
Expand
Highly Cited
2003
Highly Cited
2003
Fast pose estimation with parameter-sensitive hashing
Gregory Shakhnarovich
,
Paul A. Viola
,
Trevor Darrell
Proceedings Ninth IEEE International Conference…
2003
Corpus ID: 2051403
Example-based methods are effective for parameter estimation problems when the underlying system is simple or the dimensionality…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE