Piotr Indyk
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 4 in the filters
on a stage with
- Haike Xuonce
- Talya Edenonce
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| A Bi-metric Framework for Fast Similarity Search | Extroverted Sublinear Algorithms 2024 | 2024-06-17 |
Proposes a bi-metric pipeline that builds indices with a cheap proxy (Euclidean embeddings, sketched) and queries with an expensive ground-truth (cross-encoder… | ||
| A Near-Linear Time Algorithm for the Chamfer Distance | Sketching and Algorithm Design 2023 | 2023-10-09 |
Claim: a one-plus-epsilon approximation to Chamfer distance in near-linear time, roughly O(d n log n / ε^2), achieved by computing crude nearest-neighbor… | ||
| Embeddings and labeling schemes for A* | ITCS 2022 | 2022-01-31 |
Proves nearly tight tradeoffs between heuristic complexity and A scans: for Lp embeddings with dimension D < N/log N A scans Ω(N) on average; for L∞ or… | ||
| Learning-Augmented Sketches for Frequency Estimation | Sublinear Algorithms and Nearest-Neighbor Search | 2018-11-27 |
Augments hashing-based frequency sketches with a learned binary oracle (RNN and decision-tree attempts) that flags heavy items after training on a prefix, then… | ||
| nothing matches | ||