Nearest neighbor problems

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Nearest neighbor problems

Full text

Pdf (641 KB)

Source

Annual Symposium on Computational Geometry archive
Proceedings of the seventh annual symposium on Computational geometry table of contents

North Conway, New Hampshire, United States

Pages: 224 - 233

Year of Publication: 1991

ISBN:0-89791-426-0

Author

Gordon Wilfong

AT&T Bell Laboratories, Murray Hill, NJ

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 22, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/109648.109673 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	CE85	Bernard Chazelle , Herbert Edelsbrunner, An improved algorithm for constructing kth-order Voronoi diagrams, Proceedings of the first annual symposium on Computational geometry, p.228-234, June 05-07, 1985, Baltimore, Maryland, United States [doi>10.1145/323233.323263]
	Cla85	K Clarkson, A probabilistic algorithm for the post office problem, Proceedings of the seventeenth annual ACM symposium on Theory of computing, p.175-184, May 06-08, 1985, Providence, Rhode Island, United States [doi>10.1145/22145.22165]
	DE84	W.H.E. Day and H. Edelsbrunner. Efficient algorithms for agglomerative hierarchical clustering methods. Journal of Classification, 1:1-24, 1984.
	DS86	D.P. Dobkin and D. L. Souvaine. Computational geometry- A user's guide. In J. T. Schwartz and C. K. Yap, editors, Advances in Robotics, Volume 1: Algorithmic and Geometric Aspects. Lawrence Erlbaum Assoc., HiUsdale, N J, 1986.
	Ede87	Herbert Edelsbrunner, Algorithms in combinatorial geometry, Springer-Verlag New York, Inc., New York, NY, 1987
	Har68	P.E. Hart. The condensed nearest neighbor rule. IEEE Transactions on Information Theory, pages 515-516, 1968.
	HD55	H. Hadwiger and H. Debrunner. Kombinatorische geometrie in der ebene. In Monographies de l'Enseignement Mathematique. Geneva, 1955.
	MIH81	S. Masuyama, T. Ibaraki, and T. Hasegawa. The computational complexity of the m-center problems in the plane. The Transactions of the IECE o.t Japan, E 64(2):57-64, 1981.
	RWLI75	R. L. Ritter, H. B. Woodruff, S. R. Lowry, and T. L. Isenhour. An algorithm for a selective nearest neighbor decision rule. IEEE Transactions on Information Theory, pages 665-669, 1975.

CITED BY 2

	Baihua Zheng , Jianliang Xu , Wang-Chien Lee , Lun Lee, Grid-partition index: a hybrid method for nearest-neighbor queries in wireless location-based services, The VLDB Journal — The International Journal on Very Large Data Bases, v.15 n.1, p.21-39, January 2006
	Cor J. Veenman , Marcel J. T. Reinders, The Nearest Subclass Classifier: A Compromise between the Nearest Mean and Nearest Neighbor Classifier, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.27 n.9, p.1417-1429, September 2005