NearOptimal Hashing Algorithms for Approximate Nearest N eighbor in High Dimensi

NearOptimal Hashing Algorithms for Approximate Nearest N eighbor in High Dimensi NearOptimal Hashing Algorithms for Approximate Nearest N eighbor in High Dimensi - Start

2014-10-03 81K 81 0 0

Description

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 Download Pdf

Embed code:
Download Pdf

NearOptimal Hashing Algorithms for Approximate Nearest N eighbor in High Dimensi




Download Pdf - 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


About DocSlides
DocSlides allows users to easily upload and share presentations, PDF documents, and images.Share your documents with the world , watch,share and upload any time you want. How can you benefit from using DocSlides? DocSlides consists documents from individuals and organizations on topics ranging from technology and business to travel, health, and education. Find and search for what interests you, and learn from people and more. You can also download DocSlides to read or reference later.