Alex Andoni
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 3 in the filters
on a stage with
never shared a talk
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Spectral Partitioning for Metrics (And NNs Too) | Sublinear Algorithms and Nearest-Neighbor Search | 2018-11-27 |
Gives a concrete parameter, the cutting modulus, and proves it controls approximate nearest‑neighbor complexity: for any norm on R^d there is a cell‑probe data… | ||
| Optimal Data-Dependent Hashing for Nearest Neighbor Search | Computational Complexity of Low-Polynomial Time Problems (Simons Institute workshop, 2015) | 2015-12-08 |
Claims a concrete improvement over LSH: using data-dependent hashing and a tree of partitions that alternates dense-cluster extraction and cap carving… | ||
| Algorithmic High-Dimensional Geometry I | Big Data Boot Camp 2013 | 2013-09-03 |
Shows that random linear maps (Gaussian projections, i.e. the Johnson-Lindenstrauss lemma) cut dimension to k = O(log n / ε^2) and preserves pairwise distances… | ||
| Algorithmic High-Dimensional Geometry II | Big Data Boot Camp 2013 | 2013-09-03 |
Shows that datasets with doubling dimension λ admit ANN by projecting to O(λ) dimensions with asymmetric contraction/expansion guarantees and by using… | ||
| nothing matches | ||