Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

lsh

lsh is a free software implementation of the Secure Shell (SSH) protocol version 2, by the GNU Project including both server and client programs… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
We show the existence of a Locality-Sensitive Hashing (LSH) family for the angular distance that yields an approximate Near… Expand
  • figure 1
  • table 1
  • figure 3
  • table 2
  • table 3
Is this relevant?
Highly Cited
2014
Highly Cited
2014
We present the first provably sublinear time algorithm for approximate \emph{Maximum Inner Product Search} (MIPS). Our proposal… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2013
Highly Cited
2013
Many object detection systems are constrained by the time required to convolve a target image with a bank of filters that code… Expand
  • figure 1
Is this relevant?
Highly Cited
2012
Highly Cited
2012
There has been growing interest in the use of binary-valued features, such as BRIEF, ORB, and BRISK for efficient local feature… Expand
  • figure 2
  • figure 1
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Feature matching is at the base of many computer vision problems, such as object recognition or structure from motion. Current… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Although Locality-Sensitive Hashing (LSH) is a promising approach to similarity search in high-dimensional spaces, it has not… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Similarity indices for high-dimensional data are very desirable for building content-based search systems for feature-rich data… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Given two input collections of sets, a set-similarity join (SSJoin) identifies all pairs of sets, one from each collection, that… Expand
  • figure 1
  • figure 5
  • figure 3
  • figure 4
  • figure 7
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We consider the problem of indexing high-dimensional data for answering (approximate) similarity-search queries. Similarity… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Example-based methods are effective for parameter estimation problems when the underlying system is simple or the dimensionality… Expand
  • figure 1
  • figure 3
  • table 1
  • figure 4
  • figure 5
Is this relevant?