Optimal Data-Dependent Hashing for Nearest Neighbor 🔍
Explores efficient data-dependent hashing methods for fast nearest neighbor search in high-dimensional data.
Simons Institute for the Theory of Computing
3.7K views • Dec 8, 2015
About this video
Alex Andoni, Columbia University
Computational Complexity of Low-Polynomial Time Problems
https://simons.berkeley.edu/talks/alex-andoni-2015-12-01
Computational Complexity of Low-Polynomial Time Problems
https://simons.berkeley.edu/talks/alex-andoni-2015-12-01
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
3.7K
Likes
50
Duration
49:09
Published
Dec 8, 2015
User Reviews
4.4
(3) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
Trending Now