Ilya Razenshteyn
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 2 in the filters
on a stage with
never shared a talk
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Holder Homeomorphisms and Approximate Nearest Neighbors | Sublinear Algorithms and Nearest-Neighbor Search | 2018-11-27 |
New algorithms give time‑efficient ANN for arbitrary norms in R^D with subpolynomial approximation (exp((log D)^{2/3})) using polynomial space and… | ||
| Nearest Neighbor Methods I | Foundations of Data Science Boot Camp 2018 | 2018-08-27 |
Nearest-neighbor search is framed as approximate search with radius R and approximation C, and the core claim is that locality-sensitive hashing (LSH) yields… | ||
| Nearest Neighbor Methods II | Foundations of Data Science Boot Camp 2018 | 2018-08-27 |
Covers concrete algorithms and limits: a deterministic L∞ decision-tree gives O(log log D) approximation with near-linear space and O(d log N) query work… | ||
| nothing matches | ||