Optimal Data-Dependent Hashing for Nearest Neighbor Search
3,706 views · Published 8 December 2015 · 49:09 · Indexed 30 September 2026
Channel: Simons Institute for the Theory of Computing · 2015 · Education
Alex Andoni, Columbia University Computational Complexity of Low-Polynomial Time Problems https://simons.berkeley.edu/talks/alex-andoni-2015-12-01
More from this channel
-
27:28
The Query Complexity of Correlated Equilibria
-
31:37
Robustness and Separation in Multidimensional Mechanism Design
-
29:08
An Isomorphism Between Parameterized Complexity and Classical Complexity, for both Time and Space
-
33:14
Sub-exponential Approximation Schemes for CSPs: from Dense to Almost Sparse
-
45:30
Informational Substitutes and Complements for Prediction
-
50:56
Incentive Auctions and Spectrum Repacking
-
23:27
Which Regular Expression Patterns are Hard to Match?
-
24:46
Five Things I Learned from Dick Karp