Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces.

Rodrigo Paredes|Edgar Chávez


Anthology ID:DBLP:conf/spire/ParedesC05
Volume:String Processing and Information Retrieval, 12th International Conference, SPIRE 2005, Buenos Aires, Argentina, November 2-4, 2005, Proceedings
Year:2005
Venue:Symposium on String Processing and Information Retrieval (SPIRE)
Publisher:Springer
Pages:127-138
URL:https://doi.org/10.1007/11575832_14
DOI:https://doi.org/10.1007/11575832_14
DBLP:conf/spire/ParedesC05
BibTeX:
@inproceedings{paredes-2005-using, author = {Rodrigo Paredes and Edgar Ch\'{a}vez}, editor = {Mariano P. Consens and Gonzalo Navarro}, title = {{Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces}}, booktitle = {{String Processing and Information Retrieval, 12th International Conference, SPIRE 2005, Buenos Aires, Argentina, November 2-4, 2005, Proceedings}}, series = {Lecture Notes in Computer Science}, volume = {3772}, pages = {127--138}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11575832_14}, doi = {https://doi.org/10.1007/11575832_14} }