Talks
Fall 2015

Optimal Data-Dependent Hashing for Nearest Neighbor Search

Tuesday, December 1st, 2015, 11:15 am12:00 pm

Add to Calendar

We show how a "worst case to random case" reduction for high-dimensional pointsets leads to optimal hashing for approximate nearest neighbor search. 

Joint work with Ilya Razenshteyn.