Matching large graphs, fast.

Speaker: 
Jose Ferreira
Date: 
Oct 4 2016 - 12:30pm
Event type: 
Graduate Student Seminar
Room: 
Fine Hall 214
Abstract: 

I'll talk about the graph matching problem, and go over a couple of recent (and not so recent) algorithms based on continuous relaxation to quickly match large-ish graphs.