Please note that ISTA Research Explorer 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 |
A study of lagrangean decompositions and dual ascent solvers for graph matching
P. Swoboda, C. Rother, C. Abu Alhaija, D. Kainmueller, B. Savchynskyy, in:, IEEE, 2017, pp. 7062–7071.
[Submitted Version]
View
| Files available
| DOI
| WoS
P. Swoboda, C. Rother, C. Abu Alhaija, D. Kainmueller, B. Savchynskyy, in:, IEEE, 2017, pp. 7062–7071.
2017 | Conference Paper | IST-REx-ID: 915 |
A message passing algorithm for the minimum cost multicut problem
P. Swoboda, B. Andres, in:, IEEE, 2017, pp. 4990–4999.
[Submitted Version]
View
| Files available
| DOI
| WoS
P. Swoboda, B. Andres, in:, IEEE, 2017, pp. 4990–4999.
2017 | Conference Paper | IST-REx-ID: 917 |
A dual ascent framework for Lagrangean decomposition of combinatorial problems
P. Swoboda, J. Kuske, B. Savchynskyy, in:, IEEE, 2017, pp. 4950–4960.
[Submitted Version]
View
| Files available
| DOI
| WoS
P. Swoboda, J. Kuske, B. Savchynskyy, in:, IEEE, 2017, pp. 4950–4960.
2017 | Conference Paper | IST-REx-ID: 274 |
A faster approximation algorithm for the Gibbs partition function
V. Kolmogorov, in:, Proceedings of the 31st Conference On Learning Theory, ML Research Press, 2017, pp. 228–249.
[Published Version]
View
| Files available
| arXiv
V. Kolmogorov, in:, Proceedings of the 31st Conference On Learning Theory, ML Research Press, 2017, pp. 228–249.
2017 | Research Data | IST-REx-ID: 5561 |
Graph matching problems for annotating C. Elegans
D. Kainmueller, F. Jug, C. Rother, G. Meyers, (2017).
[Published Version]
View
| Files available
| DOI
D. Kainmueller, F. Jug, C. Rother, G. Meyers, (2017).