Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
In this paper, we examine the hash functions expressed as scalar products, i.e., $f(x)= $, for some bounded random vector $v… 
2014
2014
In a biometric recognition task, the manifold of data is the result of the interactions between the sub-manifold of dynamic… 
2012
2012
Nearest neighbor problem has recently been a research focus, especially on large amounts of data. Locality sensitive hashing (LSH… 
2012
2012
Locality sensitive hashing (LSH) has been introduced as an indexing structure for fast large-scale data retrieval. A significant… 
2012
2012
We propose a learning method with feature selection for Locality-Sensitive Hashing. Locality-Sensitive Hashing converts feature… 
2011
2011
Similarity joins are important operations with a broad range of applications. In this paper, we study the problem of vector… 
2010
2010
In this paper, we study the problem of detecting near duplicates for high dimensional data points in an incremental manner. For… 
2009
2009
Homomorphic hash functions (HHFs) have been applied into peer-to-peer networks with erasure coding or network coding to defend… 
2006
2006
  • Liang WangD. Suter
  • 2006
  • Corpus ID: 1120094
A novel method for learning and recognizing sequential image data is proposed, and promising applications to vision-based human… 
1992
1992
The need to achieve higher performance through greater degrees of parallelism necessitates distributing the memory throughout a…