Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
75 Publications
2017 | Conference Paper | IST-REx-ID: 916 | 
Swoboda P, Rother C, Abu Alhaija C, Kainmueller D, Savchynskyy B. 2017. A study of lagrangean decompositions and dual ascent solvers for graph matching. CVPR: Computer Vision and Pattern Recognition vol. 2017, 7062–7071.
[Submitted Version]
View
| Files available
| DOI
| WoS
2017 | Conference Paper | IST-REx-ID: 915 |
Swoboda P, Andres B. 2017. A message passing algorithm for the minimum cost multicut problem. CVPR: Computer Vision and Pattern Recognition vol. 2017, 4990–4999.
[Submitted Version]
View
| Files available
| DOI
| WoS
2017 | Conference Paper | IST-REx-ID: 917 |
Swoboda P, Kuske J, Savchynskyy B. 2017. A dual ascent framework for Lagrangean decomposition of combinatorial problems. CVPR: Computer Vision and Pattern Recognition vol. 2017, 4950–4960.
[Submitted Version]
View
| Files available
| DOI
| WoS
2017 | Conference Paper | IST-REx-ID: 274 |
Kolmogorov V. 2017. A faster approximation algorithm for the Gibbs partition function. Proceedings of the 31st Conference On Learning Theory. COLT: Annual Conference on Learning Theory vol. 75, 228–249.
[Published Version]
View
| Files available
| arXiv
2017 | Research Data | IST-REx-ID: 5561 |
Kainmueller D, Jug F, Rother C, Meyers G. 2017. Graph matching problems for annotating C. Elegans, Institute of Science and Technology Austria, 10.15479/AT:ISTA:57.
[Published Version]
View
| Files available
| DOI