Locality-preserving hashing

Known as: Locality preserving hashing 
In computer science, a locality-preserving hashing is a hash function f that maps a point or points in a multidimensional coordinate space to a… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1997-2016
01219972016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Hashing has recently attracted considerable attention for large scale similarity search. However, learning compact codes with… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 6
  • figure 7
Is this relevant?
2014
2014
The spectral hashing algorithm relaxes and solves an objective function for generating hash codes such that data similarity is… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2014
2014
Binary hashing is widely used in efficient similarity computing for image/video search. In this work, we propose a Locality… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
Is this relevant?
2013
2013
Efficient and scalable distributed metadata management is critically important to overall system performance in large-scale… (More)
Is this relevant?
2010
2010
The problem of defining a support for multidimensional range queries on P2P overlays is currently an active field of research… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
Publish/subscribe model has become a prevalent paradigm for building distributed event delivering systems. Content-based publish… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
2007
2007
Publish/subscribe model has become a prevalent paradigm for building distributed event delivering systems. Content-based publish… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Recent structured Peer-to-Peer (P2P) systems such as Distributed Hash Tables (DHTs) offer scalable key-based lookup for… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We consider localitg-preserving hashing — in which adjacent points in the domain are mapped to adjacent or nearlyadjacent points… (More)
Is this relevant?