<--- Back to Details
First PageDocument Content
Search algorithms / Discrete geometry / Data mining / Information retrieval / Nearest neighbor search / K-d tree / K-nearest neighbor algorithm / Point location / Voronoi diagram / Information science / Mathematics / Geometry
Date: 2003-06-25 21:29:03
Search algorithms
Discrete geometry
Data mining
Information retrieval
Nearest neighbor search
K-d tree
K-nearest neighbor algorithm
Point location
Voronoi diagram
Information science
Mathematics
Geometry

Add to Reading List

Source URL: www.cs.umd.edu

Download Document from Source Website

File Size: 270,21 KB

Share Document on Facebook

Similar Documents

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