Disorder inequality: a combinatorial approach to nearest neighbor search.

Navin Goyal|Yury Lifshits|Hinrich Schütze


Anthology ID:DBLP:conf/wsdm/GoyalLS08
Volume:Proceedings of the International Conference on Web Search and Web Data Mining, WSDM 2008, Palo Alto, California, USA, February 11-12, 2008
Year:2008
Venue:Web Search and Data Mining (WSDM)
Publisher:ACM
Pages:25-32
URL:https://doi.org/10.1145/1341531.1341538
DOI:https://doi.org/10.1145/1341531.1341538
DBLP:conf/wsdm/GoyalLS08
BibTeX:
@inproceedings{goyal-2008-disorder, author = {Navin Goyal and Yury Lifshits and Hinrich Sch\"{u}tze}, editor = {Marc Najork and Andrei Z. Broder and Soumen Chakrabarti}, title = {{Disorder inequality: a combinatorial approach to nearest neighbor search}}, booktitle = {{Proceedings of the International Conference on Web Search and Web Data Mining, WSDM 2008, Palo Alto, California, USA, February 11-12, 2008}}, pages = {25--32}, publisher = {ACM}, year = {2008}, url = {https://doi.org/10.1145/1341531.1341538}, doi = {https://doi.org/10.1145/1341531.1341538} }