The Nearest Neighbour Problem in Information Retrieval: An Algorithm Using Upperbounds.
Alan F. Smeaton|C. J. van Rijsbergen
| Anthology ID: | DBLP:conf/sigir/SmeatonR81 |
|---|---|
| Volume: | Theoretical Issues in Information Retrieval, Proceedings of the Fourth International Conference on Information Storage and Retrieval, Oakland, California, USA, May 31 - June 2, 1981 |
| Year: | 1981 |
| Venue: | Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) |
| Publisher: | ACM |
| Pages: | 83-87 |
| URL: | https://doi.org/10.1145/511754.511767 |
| DOI: | https://doi.org/10.1145/511754.511767 |
| DBLP: | conf/sigir/SmeatonR81 |
| BibTeX: |
@inproceedings{smeaton-1981-nearest,
author = {Alan F. Smeaton and
C. J. van Rijsbergen},
editor = {Carolyn J. Crouch},
title = {{The Nearest Neighbour Problem in Information Retrieval: An Algorithm Using Upperbounds}},
booktitle = {{Theoretical Issues in Information Retrieval, Proceedings of the Fourth International Conference on Information Storage and Retrieval, Oakland, California, USA, May 31 - June 2, 1981}},
pages = {83--87},
publisher = {ACM},
year = {1981},
url = {https://doi.org/10.1145/511754.511767},
doi = {https://doi.org/10.1145/511754.511767}
}