Talks
Fall 2015
![](https://old.simons.berkeley.edu/sites/default/files/styles/workshop_main/public/complexity_logo_final.png?itok=bgRCs3HD)
Optimal Data-Dependent Hashing for Nearest Neighbor Search
Tuesday, December 1st, 2015, 11:15 am–12:00 pm
Speaker:
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.
Attachment | Size |
---|---|
![]() | 2.02 MB |