Graph Matching: Relax or Not?

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=68RDaUv26qI


Duration: 56:17
794 views
3

Alex Bronstein, Tel Aviv University
Spectral Algorithms: From Theory to Practice
http://simons.berkeley.edu/talks/alex-bronstein-2014-10-29



Other Videos By Simons Institute for the Theory of Computing


2014-11-14On Strassen's Conjecture
2014-11-14Matrix Multiplication: Coppersmith-Winograd and Beyond
2014-11-14Uniqueness of Tensor Decomposition and Identifiability in Mixture Models
2014-11-04An Efficient Parallel Solver for SDD Linear Systems
2014-11-04Graph Based Processing of Big Images
2014-11-03Autocatalytic Sets and Models of Early Life
2014-11-03Some Applications in Human Behavior Modeling
2014-11-03Comparing the Theory and Practice of Spectral Algorithms to Combinatorial Flow Algorithms for ...
2014-11-03Spectral Approaches to Nearest Neighbor Search
2014-11-03Learning Functions and Sets with Spectral Regularization
2014-11-03Graph Matching: Relax or Not?
2014-11-03Random Embeddings, Matrix-valued Kernels and Deep Learning
2014-11-03Exact Recovery via Convex Relaxations
2014-11-03Random Walks on Simplicial Complexes and Isoperimetric Inequalities
2014-11-03A Statistical Model for Tensor Principal Component Analysis
2014-11-03The Impact of Regularization in Spectral Clustering
2014-11-03Spectral Algorithms for Learning Latent Variable Models
2014-11-03Some Probabilistic Uses of Dirichlet Eigenvectors
2014-11-03Multiscale Analysis on and of Graphs
2014-11-03Applied Hodge Theory
2014-11-03The Hidden Convexity of Spectral Clustering


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Algorithmic Spectral Graph Theory
Alex Bronstein