Download

NearOptimal Hashing Algorithms for Approximate Nearest N eighbor in High Dimensi PDF document - DocSlides

yoshiko-marsland | 2014-10-03 | General

edu Piotr Indyk MIT indykmitedu Abstract We present an algorithm for the approximate near est neighbor problem in a dimensional Euclidean space achieving query time of dn c 1 and space dn 11 c 1 This almost matches the lower bound for hashingbased a ID: 2306

---

• Direct Link:
• Link:https://www.docslides.com/yoshiko-marsland/nearoptimal-hashing-algorithms-for-approximate-nearest-n-eighbor-in-hi
• Embed code:

DownloadNote - The PPT/PDF document "NearOptimal Hashing Algorithms for Appro..." is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.

Presentations text content in NearOptimal Hashing Algorithms for Approximate Nearest N eighbor in High Dimensi

Show

---