Alex Bronstein
where else to find them
github:alexbronstein16
linkedin:alex-bronstein
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 |
|---|---|---|
| Graph Matching: Relax or Not? | Spectral Algorithms: From Theory to Practice 2014 | 2014-10-27 |
Convex quadratic relaxation over pseudo-stochastic matrices recovers the exact permutation whenever adjacency matrices have simple spectrum and no eigenvector… | ||
| nothing matches | ||