Joshua Alman
where else to find them
no profile links on file
what they talk about
their talks carry no tags yet
where they keep going back
no series more than once — all 1 in the filters
on a stage with
never shared a talk
who talks about the same things
one talk is not yet a subject
| title | conference | date |
|---|---|---|
| Probabilistic Polynomials and Hamming Nearest Neighbors | Connections Between Algorithm Design and Complexity Theory | 2015-09-28 |
Claims an offline algorithm for n batch Hamming nearest neighbors that is truly subquadratic when d = c log n: time n^{2 - 1/O(c log^2 c)} for constant c, by… | ||
| nothing matches | ||