Rasmus Pagh
where else to find them
github:rasmus-pagh
bluesky:rasmuspagh.net
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 |
|---|---|---|
| Resizable Sketches | Sketching and Algorithm Design 2023 | 2023-10-09 |
Proves a lower bound that any one-sided dynamic approximate membership must pay about log log n bits per element at some point, and gives a matching upper… | ||
| Efficient Reductions for k-Nearest Neighbor Search | Sublinear Algorithms and Nearest-Neighbor Search | 2018-11-27 |
Proposes a practical stopping rule called confirmation sampling that queries multiple LSH-style structures until the current best point appears T+1 times… | ||
| nothing matches | ||