1 code implementation • CVPR 2017 • Paul Swoboda, Jan Kuske, Bogdan Savchynskyy
We propose a general dual ascent framework for Lagrangean decomposition of combinatorial problems.
Graph Matching