References for the “Algorithmic High Dimensional Geometry” lectures at the Big Data Boot Camp, Simons Institute, Berkeley Alexandr Andoni Microsoft Research SVC September 4, 2013

First Page		Document Content
Date: 2013-09-12 03:13:30 Year of birth missing Discrete geometry Symposium on Foundations of Computer Science Symposium on Theory of Computing Piotr Indyk Machine learning Kenneth L. Clarkson Computational geometry Streaming algorithm Mathematics Geometry Theoretical computer science		References for the “Algorithmic High Dimensional Geometry” lectures at the Big Data Boot Camp, Simons Institute, Berkeley Alexandr Andoni Microsoft Research SVC September 4, 2013 Add to Reading List Source URL: www.mit.edu Download Document from Source Website File Size: 133,72 KB Share Document on Facebook

	Practical and Optimal LSH for Angular Distance Alexandr Andoni∗ Columbia University Piotr Indyk DocID: 1ts9u - View Document
	Approximate Nearest Neighbors Search in High Dimensions and Locality-Sensitive Hashing PAPERS Piotr Indyk, Rajeev Motwani: Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality, STOC 1998. DocID: 1tqic - View Document
	Streaming Algorithms for Set Cover Piotr Indyk With: Sepideh Mahabadi, Ali Vakilian Set Cover DocID: 1t519 - View Document
	Introduction to Algorithms: 6.006 Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis March 1st, 2011 Problem Set 3 DocID: 1su0X - View Document
	Introduction to Algorithms: 6.006 Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis April 12, 2011 Problem Set 6 DocID: 1sc7U - View Document