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.




60 Publications

2017 | Research Data | IST-REx-ID: 5561 | OA
Kainmueller, Dagmar, et al. Graph Matching Problems for Annotating C. Elegans. IST Austria, 2017, doi:10.15479/AT:ISTA:57.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 274 | OA
Kolmogorov, Vladimir. “A Faster Approximation Algorithm for the Gibbs Partition Function.” Proceedings of the 31st Conference On Learning Theory, vol. 75, PMLR, 2017, pp. 228–49.
View | Files available | arXiv
 
2017 | Conference Paper | IST-REx-ID: 641
Trajkovska, Vera, et al. Graphical Model Parameter Learning by Inverse Linear Programming. Edited by François Lauze et al., vol. 10302, Springer, 2017, pp. 323–34, doi:10.1007/978-3-319-58771-4_26.
View | DOI
 
2017 | Journal Article | IST-REx-ID: 644 | OA
Kolmogorov, Vladimir, et al. “The Complexity of General-Valued CSPs.” SIAM Journal on Computing, vol. 46, no. 3, SIAM, 2017, pp. 1087–110, doi:10.1137/16M1091836.
View | Files available | DOI | Download Preprint (ext.)
 
2017 | Conference Paper | IST-REx-ID: 646 | OA
Kuske, Jan, et al. A Novel Convex Relaxation for Non Binary Discrete Tomography. Edited by François Lauze et al., vol. 10302, Springer, 2017, pp. 235–46, doi:10.1007/978-3-319-58771-4_19.
View | DOI | Download Submitted Version (ext.)
 
2017 | Conference Paper | IST-REx-ID: 915 | OA
Swoboda, Paul, and Bjoern Andres. A Message Passing Algorithm for the Minimum Cost Multicut Problem. Vol. 2017, IEEE, 2017, pp. 4990–99, doi:10.1109/CVPR.2017.530.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 916 | OA
Swoboda, Paul, et al. A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching. Vol. 2017, IEEE, 2017, pp. 7062–71, doi:10.1109/CVPR.2017.747.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 917 | OA
Swoboda, Paul, et al. A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems. Vol. 2017, IEEE, 2017, pp. 4950–60, doi:10.1109/CVPR.2017.526.
View | Files available | DOI
 
2017 | Thesis | IST-REx-ID: 992 | OA
Rolinek, Michal. Complexity of Constraint Satisfaction. IST Austria, 2017, doi:10.15479/AT:ISTA:th_815.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 1192 | OA
Kazda, Alexandr, et al. Even Delta-Matroids and the Complexity of Planar Boolean CSPs. SIAM, 2017, pp. 307–26, doi:10.1137/1.9781611974782.20.
View | Files available | DOI | Download Submitted Version (ext.)
 

Search

Display / Sort

Citation Style: MLA

Export / Embed