Similarity Search in High Dimensions Piotr Indyk MIT Definitions

First Page		Document Content
Date: 2011-08-18 19:22:52 Geometry Discrete geometry Approximation algorithms Computational geometry Information retrieval Nearest neighbor search Voronoi diagram K-d tree K-nearest neighbor algorithm Information science Mathematics Search algorithms		Similarity Search in High Dimensions Piotr Indyk MIT Definitions Add to Reading List Source URL: people.csail.mit.edu Download Document from Source Website File Size: 178,04 KB Share Document on Facebook

	TerraNNI: Natural Neighbor Interpolation on 2D and 3D Grids Using a GPU PANKAJ K. AGARWAL, Duke University ALEX BEUTEL, Carnegie Mellon University THOMAS MØLHAVE, SCALGO USA DocID: 1ru58 - View Document
	40 ALGORITHMIC MOTION PLANNING Mi ha Sharir INTRODUCTION DocID: 1rqDw - View Document
	PIECE BY PIECE: A METHOD OF CARTOGRAPHIC LINE GENERALIZATION USING REGULAR HEXAGONAL TESSELLATION P. Raposo Department of Geography, The Pennsylvania State University. University Park, Pennsylvania DocID: 1rnN0 - View Document
	Kinetic Data Structures: Animating Proofs Through Time Julien Basch∗ Jo˜ao Comba† Leonidas J. Guibas‡ John Hershberger§ Craig D. Silverstein¶ Li Zhangk When motion begins, each certificate remains valid until th DocID: 1rmpv - View Document