Skip to contentSkip to filters

We use cookies for analytics.

Optimal Data-Dependent Hashing for Nearest Neighbor Search

Alex Andoni

Recording

49 min

Abstract

This talk develops optimal hashing methods for approximate nearest-neighbor search by reducing worst-case high-dimensional point sets to random instances. The approach connects the structure of arbitrary datasets with hashing constructions designed for random data. The work is joint with Ilya Razenshteyn.

Topics