Luis Rademacher
where else to find them
what they talk about
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 |
|---|---|---|
| The Hidden Convexity of Spectral Clustering | Spectral Algorithms: From Theory to Practice 2014 | 2014-10-27 |
Shows that K-way spectral clustering is recovered exactly by maximizing a contrast F(u)=sum_i G(u·x_i) on the sphere when G(√t) is strictly convex (plus a mild… | ||
| nothing matches | ||