Algorithms for Fast Vector Quantization∗ Sunil Arya† Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong David M. Mount‡

First Page		Document Content
Date: 2006-04-04 04:49:15 Computing Nearest neighbor search K-d tree K-nearest neighbor algorithm Tree B-tree Binary search tree R-tree Proximity problems Information science Mathematics Search algorithms		Algorithms for Fast Vector Quantization∗ Sunil Arya† Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong David M. Mount‡ Add to Reading List Source URL: www.cse.ust.hk Download Document from Source Website File Size: 184,38 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