Alexandr 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 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 |
|---|---|---|
| The Sketching Complexity of Graph Cuts | Fast Algorithms via Spectral Methods 2014 | 2014-12-01 |
Claim: any graph-format sparsifier that preserves all cuts needs n/ε^2 lower bound edges, but allowing a non-graph sketch of size O(n/ε polylog n) with a… | ||
| Spectral Approaches to Nearest Neighbor Search | Spectral Algorithms: From Theory to Practice 2014 | 2014-10-27 |
Proposes reducing approximate nearest neighbor to a spectral graph problem, building a sparsified neighborhood graph and embedding via Laplacian eigenmaps so… | ||
| nothing matches | ||