DocumentCode :
2181633
Title :
Fast algorithms for the all nearest neighbors problem
Author :
Clarkson, Kenneth L.
fYear :
1983
fDate :
7-9 Nov. 1983
Firstpage :
226
Lastpage :
232
Keywords :
Computational geometry; Computer science; Cost function; Data analysis; Data structures; Nearest neighbor searches; Partitioning algorithms; Pattern recognition; Probability density function;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 1983., 24th Annual Symposium on
Conference_Location :
Tucson, AZ, USA
ISSN :
0272-5428
Print_ISBN :
0-8186-0508-1
Type :
conf
DOI :
10.1109/SFCS.1983.16
Filename :
4568082
Link To Document :
بازگشت