article · Australian Computer Journal · 1984
A Simple approach to the Nearest-Neighbour Problem.
Cited by 5Abstract and details only
Abstract
The index has no abstract for this paper.
Cite this paper
Abel, D. J., & Smith, J. L. (1984). A Simple approach to the Nearest-Neighbour Problem. Australian Computer Journal, 16, 140–146.
Abel, David J., and J. L. Smith. “A Simple approach to the Nearest-Neighbour Problem.” Australian Computer Journal, vol. 16, 1984, pp. 140–46.
Abel, David J., and J. L. Smith. 1984. “A Simple approach to the Nearest-Neighbour Problem.” Australian Computer Journal 16: 140–46.
Abel, D.J. and Smith, J.L. (1984) ‘A Simple approach to the Nearest-Neighbour Problem’, Australian Computer Journal, 16, pp. 140–146.
@article{abel1984simple,
title = {{A Simple approach to the Nearest-Neighbour Problem.}},
author = {Abel, David J. and Smith, J. L.},
journal = {Australian Computer Journal},
volume = {16},
pages = {140--146},
year = {1984}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.
Related papers
Fast algorithms for the all nearest neighbors problem
Kenneth L. Clarkson · Annual Symposium on Foundations of Computer Science · 1983
Cited by 156
A Simple Randomized Algorithm for All Nearest Neighbors.
Soroush Ebadian, Hamid Zarrabi-Zadeh · Canadian Conference on Computational Geometry · 2019
Cited by 0
NearptD: A Parallel Implementation of Exact Nearest Neighbor Search using a Uniform Grid.
David Hedin, W. Randolph Franklin · Canadian Conference on Computational Geometry · 2016
Cited by 2
Good algorithms make good neighbors
Erica Klarreich · Communications of the ACM · 2019
Cited by 1
4.4 Nearest neighbor algorithms
Peter E. Jackson, Isabelle Moulinier · 2007
Cited by 0