Probabilistic Proximity Searching Algorithms Based on Compact Partitions.

Benjamin Bustos|Gonzalo Navarro


Anthology ID:DBLP:conf/spire/BustosN02
Volume:String Processing and Information Retrieval, 9th International Symposium, SPIRE 2002, Lisbon, Portugal, September 11-13, 2002, Proceedings
Year:2002
Venue:Symposium on String Processing and Information Retrieval (SPIRE)
Publisher:Springer
Pages:284-297
URL:https://doi.org/10.1007/3-540-45735-6_25
DOI:https://doi.org/10.1007/3-540-45735-6_25
DBLP:conf/spire/BustosN02
BibTeX:
@inproceedings{bustos-2002-probabilistic, author = {Benjamin Bustos and Gonzalo Navarro}, editor = {Alberto H. F. Laender and Arlindo L. Oliveira}, title = {{Probabilistic Proximity Searching Algorithms Based on Compact Partitions}}, booktitle = {{String Processing and Information Retrieval, 9th International Symposium, SPIRE 2002, Lisbon, Portugal, September 11-13, 2002, Proceedings}}, series = {Lecture Notes in Computer Science}, volume = {2476}, pages = {284--297}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-45735-6_25}, doi = {https://doi.org/10.1007/3-540-45735-6_25} }