 Date: 2014-11-28 11:05:21Mathematics Geometry Computer science Search algorithms Discrete geometry Computational geometry Mathematical optimization Closest pair of points problem Nearest neighbor search Nearest neighbor graph K-nearest neighbors algorithm Euclidean minimum spanning tree | |  Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717
Add to Reading ListSource URL: bioinfo.ict.ac.cnDownload Document from Source Website File Size: 63,94 KBShare Document on Facebook
|
