Toggle navigation
PDFSEARCH.IO
Document Search Engine - browse more than 18 million documents
Sign up
Sign in
Back to Results
First Page
Meta Content
View Document Preview and Link
A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube Amit Chakrabarti Bernard Chazelle Benjamin Gum
Add to Reading List
Document Date: 2003-08-25 20:06:33
Open Document
File Size: 527,06 KB
Share Result on Facebook
UPDATE
A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube Amit Chakrabarti Bernard Chazelle Benjamin Gum