Similarity search in large collections of high-dimensional data (e.g., images, text, etc.) is a notoriously difficult yet fascinating computational problem. In this talk I will present an overview of old and new algorithms for this problem, with the emphasis on methods based on "Locality-Sensitive Hashing".

Wednesday, January 18, 2006

307 Levine Hall

3:00pm - pm