r1 - 20 Jan 2007 - 09:33:11 - MichaelCaseyYou are here: OMRAS2 > 
Main Web > ToolDev > LocalitySensitiveHashing
Main Web > ToolDev > LocalitySensitiveHashingLocality Sensitive Hashing for Low Level Feature Indexing
Audio Fingerprinting systems use hashing to perform fast lookup of song signatures in large databases. However, these systems identify only the single closest match in the database by making the chosen audio features robust to signal distortions due to the channel. An alternative is to perform a hash lookup that implements nearest neighbour searching. That is, all the close neighbours within a given radius are returned by the hash search. The idea is that you get the very efficient retrieval speed of hashing but with rankings as in a full similarity search.Locality Sensitive Hashing (LSH) Home Page
| Locality-Sensitive Hashing (LSH) is an algorithm for solving the ... On this webpage, you will find pointers to the newest LSH algorithm in Euclidean (l_2) ... web.mit.edu/andoni/www/LSH/index.html - 5k - |
The Geomblog: SoCG? 2006: Locality Sensitive Hashing.
| Locality-sensitive hashing is a way to take hashing to a geometric arena (you ... Locality-sensitive hashing gives you a data structure that answers such ... geomblog.blogspot.com/2006/06/ |
Approximate NN search and locality sensitive hashing
| Approximate NN search and locality sensitive hashing. Postscript, PDF. Last updated: Thu May 01 10:25:00 CDT 2001. valis.cs.uiuc.edu/~sariel/teach/2000/b/05_01/ - 2k - |
Marsette Vona: Locality Sensitive Hashing Applet Info
| This applet animates the Locality Sensitive Hashing [IM98] algorithm. ... Nearest Neighbor via Locality Sensitive Hashing by Piotr Indyk. ... www.mit.edu/~vona/LSH-info.html - 6k - |
Technical Reports :: Princeton Computer Science
| A Time-Space Efficient Locality Sensitive Hashing Method for Similarity Search in ... Locality Sensitive Hashing (LSH) by Indyk and Motwani is a popular ... www.cs.princeton.edu/research/techreps/TR-759-06 - 9k - |
[PDF]
1 Locality Sensitive Hash Functions
| File Format: PDF/Adobe Acrobat - View as HTML Given C and sim(x, y), a locality sensitive hash function family F operates on C ... used to construct locality sensitive hash functions for this similarity ... www.cs.princeton.edu/courses/ |
Locality-Preserving Hashing in Multidimensional Spaces - Indyk ...
| Since random string projection is a locality sensitive hashing scheme in the sense deftned by [20], we have the probability of two words of projecting to ... citeseer.ist.psu.edu/103084.html - 22k - |
[PDF]
Lower bounds on Locality Sensitive Hashing
| File Format: PDF/Adobe Acrobat - View as HTML Nearest Neighbor Search, Locality Sensitive Hashing, Lower. Bounds. 1. INTRODUCTION ... search is based on Locality Sensitive Hashing, as introduced ... theory.stanford.edu/~rinap/papers/lshlb.pdf - |
[PDF]
Efficient Large-Scale Sequence Comparison by Locality-Sensitive ...
| File Format: PDF/Adobe Acrobat - View as HTML The function f is called a locality-sensitive hash func- ... locality-sensitive) hashing keyed on their LSH values or,. for small alphabets like {A, C, G, ... www.cse.wustl.edu/~jbuhler/ |
[PPT]
Algorithms for Nearest Neighbor Search
| File Format: Microsoft Powerpoint - View as HTML quadtrees; kd-trees; Locality Sensitive Hashing ... Hash functions are locality-sensitive, if, for a random hash random function h, for any pair of points p ... dimacs.rutgers.edu/Workshops/ |
| Result Page: | 1
-- MichaelCasey - 20 Jan 2007
 Copyright © by the contributing authors. All material on this collaboration platform is the property of the contributing authors. Ideas, requests, problems regarding OMRAS2? Send feedback |
Log In
Main Web
Users
Groups
Index
Search
Changes
Notifications
Statistics
Preferences
Main