Searching for "A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube
by Amit Chakrabarti, Bernard Chazelle, Benjamin Gum, Alexey Lvov — 1999 — In Proc. 31th Annual ACM Symposium on Theory of Computing (STOC’99
…A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube…
Cited by 17 (3 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB