A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube Amit Chakrabarti Bernard Chazelle Benjamin Gum - Hamming bound - Document - PDFSEARCH.IO

First Page	Meta Content
	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 Company Admissible Queries / / Currency pence / / IndustryTerm cell-probe algorithm / conceivable sequential algorithm / randomized algorithms / search algorithm / nearest neighbor search / / Person Pr / Bob / Certainly Alice / Alice / / Technology conceivable sequential algorithm / randomized algorithm / cell-probe algorithm / even randomized algorithms / search algorithm / / SocialTag Data management Computer programming Distributed data storage Tango tree B-tree Binary trees Computing

A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube Amit Chakrabarti Bernard Chazelle Benjamin GumAdd to Reading List