Answers are grounded in this paper and cite their sources.
article Free Access Share on The nearest neighbour problem in information retrieval: an algorithm using upperbounds Authors: A. F. Smeaton University College Dublin, Belfield, Dublin University College Dublin, Belfield, DublinView Profile , C. J. van Rijsbergen University College Dublin, Belfield, Dublin University College Dublin, Belfield, DublinView Profile Authors Info & Claims ACM SIGIR ForumVolume 16Issue 1Summer 1981 pp 83–87https://doi.org/10.1145/1013228.511767Online:31 May 1981Publication History 45citation540DownloadsMetricsTotal Citations45Total Downloads540Last 12 Months17Last 6 weeks4 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!
No takes yet. Share an insight, caveat, or question.
Smeaton et al. (1981) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: