A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Amit Chakrabarti, Bernard Chazelle, Benjamin Gum, Alexey Lvov
A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube
STOC, 1999.

STOC 1999
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{STOC-1999-ChakrabartiCGL,
	author        = "Amit Chakrabarti and Bernard Chazelle and Benjamin Gum and Alexey Lvov",
	booktitle     = "{Proceedings of the 31st Annual ACM Symposium on Theory of Computing}",
	doi           = "10.1145/301250.301325",
	isbn          = "1-58113-067-8",
	pages         = "305--311",
	publisher     = "{ACM}",
	title         = "{A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube}",
	year          = 1999,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.