Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717

First Page		Document Content
Date: 2014-11-28 11:05:21 Mathematics 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 List Source URL: bioinfo.ict.ac.cn Download Document from Source Website File Size: 63,94 KB Share Document on Facebook

	Distributed Computing Prof. R. Wattenhofer BA/MA/SA/Group: Nearest Neighbor Search in Ultrametric Spaces DocID: 1tUny - View Document
	1 Product quantization for nearest neighbor search Herv´e J´egou, Matthijs Douze, Cordelia Schmid Abstract— This paper introduces a product quantization DocID: 1tzgx - View Document
	Multi-View Complementary Hash Tables for Nearest Neighbor Search Xianglong Liu† Lei Huang† Cheng Deng‡ Jiwen Lu ♮ Bo Lang† DocID: 1ttOD - View Document
	Locally Optimized Product Quantization for Approximate Nearest Neighbor Search Yannis Kalantidis and Yannis Avrithis National Technical University of Athens {ykalant, iavr}@image.ntua.gr DocID: 1tt48 - View Document
	Song Intersection by Approximate Nearest Neighbor Search Michael Casey Malcolm Slaney Goldsmiths College DocID: 1tkRr - View Document