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: 641
Trajkovska V, Swoboda P, Åström F, Petra S. Graphical model parameter learning by inverse linear programming. In: Lauze F, Dong Y, Bjorholm Dahl A, eds. Vol 10302. Springer; 2017:323-334. doi:10.1007/978-3-319-58771-4_26
View | DOI
 

2017 | Journal Article | IST-REx-ID: 644 | OA
Kolmogorov V, Krokhin A, Rolinek M. The complexity of general-valued CSPs. SIAM Journal on Computing. 2017;46(3):1087-1110. doi:10.1137/16M1091836
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 

2017 | Conference Paper | IST-REx-ID: 646 | OA
Kuske J, Swoboda P, Petra S. A novel convex relaxation for non binary discrete tomography. In: Lauze F, Dong Y, Bjorholm Dahl A, eds. Vol 10302. Springer; 2017:235-246. doi:10.1007/978-3-319-58771-4_19
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 | Thesis | IST-REx-ID: 992 | OA
Rolinek M. Complexity of constraint satisfaction. 2017. doi:10.15479/AT:ISTA:th_815
[Published Version] View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 1192 | OA
Kazda A, Kolmogorov V, Rolinek M. Even delta-matroids and the complexity of planar Boolean CSPs. In: SIAM; 2017:307-326. doi:10.1137/1.9781611974782.20
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS
 

2017 | Conference Paper | IST-REx-ID: 916 | OA
Swoboda P, Rother C, Abu Alhaija C, Kainmueller D, Savchynskyy B. A study of lagrangean decompositions and dual ascent solvers for graph matching. In: Vol 2017. IEEE; 2017:7062-7071. doi:10.1109/CVPR.2017.747
[Submitted Version] View | Files available | DOI | WoS
 

2017 | Conference Paper | IST-REx-ID: 915 | OA
Swoboda P, Andres B. A message passing algorithm for the minimum cost multicut problem. In: Vol 2017. IEEE; 2017:4990-4999. doi:10.1109/CVPR.2017.530
[Submitted Version] View | Files available | DOI | WoS
 

2017 | Conference Paper | IST-REx-ID: 917 | OA
Swoboda P, Kuske J, Savchynskyy B. A dual ascent framework for Lagrangean decomposition of combinatorial problems. In: Vol 2017. IEEE; 2017:4950-4960. doi:10.1109/CVPR.2017.526
[Submitted Version] View | Files available | DOI | WoS
 

2017 | Conference Paper | IST-REx-ID: 274 | OA
Kolmogorov V. A faster approximation algorithm for the Gibbs partition function. In: Proceedings of the 31st Conference On Learning Theory. Vol 75. ML Research Press; 2017:228-249.
[Published Version] View | Files available | arXiv
 

2017 | Research Data | IST-REx-ID: 5561 | OA
Kainmueller D, Jug F, Rother C, Meyers G. Graph matching problems for annotating C. Elegans. 2017. doi:10.15479/AT:ISTA:57
[Published Version] View | Files available | DOI
 

Filters and Search Terms

department=VlKo

Search

Filter Publications