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.




61 Publications

2017 | Conference Paper | IST-REx-ID: 646 | OA
Kuske, J., Swoboda, P., & Petra, S. (2017). A novel convex relaxation for non binary discrete tomography. In F. Lauze, Y. Dong, & A. Bjorholm Dahl (Eds.) (Vol. 10302, pp. 235–246). Presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark: Springer. https://doi.org/10.1007/978-3-319-58771-4_19
View | DOI | Download Submitted Version (ext.)
 
2017 | Conference Paper | IST-REx-ID: 915 | OA
Swoboda, P., & Andres, B. (2017). A message passing algorithm for the minimum cost multicut problem (Vol. 2017, pp. 4990–4999). Presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States: IEEE. https://doi.org/10.1109/CVPR.2017.530
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 916 | OA
Swoboda, P., Rother, C., Abu Alhaija, C., Kainmueller, D., & Savchynskyy, B. (2017). A study of lagrangean decompositions and dual ascent solvers for graph matching (Vol. 2017, pp. 7062–7071). Presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States: IEEE. https://doi.org/10.1109/CVPR.2017.747
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 917 | OA
Swoboda, P., Kuske, J., & Savchynskyy, B. (2017). A dual ascent framework for Lagrangean decomposition of combinatorial problems (Vol. 2017, pp. 4950–4960). Presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States: IEEE. https://doi.org/10.1109/CVPR.2017.526
View | Files available | DOI
 
2017 | Thesis | IST-REx-ID: 992 | OA
Rolinek, M. (2017). Complexity of constraint satisfaction. IST Austria. https://doi.org/10.15479/AT:ISTA:th_815
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 1192 | OA
Kazda, A., Kolmogorov, V., & Rolinek, M. (2017). Even delta-matroids and the complexity of planar Boolean CSPs (pp. 307–326). Presented at the SODA: Symposium on Discrete Algorithms, Barcelona, Spain: SIAM. https://doi.org/10.1137/1.9781611974782.20
View | Files available | DOI | Download Submitted Version (ext.)
 
2016 | Research Data | IST-REx-ID: 5557 | OA
Swoboda, P. (2016). Synthetic discrete tomography problems. IST Austria. https://doi.org/10.15479/AT:ISTA:46
View | Files available | DOI
 
2016 | Journal Article | IST-REx-ID: 1612 | OA
Kazda, A. (2016). CSP for binary conservative relational structures. Algebra Universalis, 75(1), 75–84. https://doi.org/10.1007/s00012-015-0358-8
View | DOI | Download Preprint (ext.)
 
2016 | Journal Article | IST-REx-ID: 1794 | OA
Kolmogorov, V., & Takhanov, R. (2016). Inference algorithms for pattern-based CRFs on sequence data. Algorithmica, 76(1), 17–46. https://doi.org/10.1007/s00453-015-0017-7
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2016 | Conference Paper | IST-REx-ID: 1193 | OA
Kolmogorov, V. (2016). Commutativity in the algorithmic Lovasz local lemma. In Proceedings - Annual IEEE Symposium on Foundations of Computer Science (Vol. 2016–December, p. 7782993). New Brunswick, NJ, USA : IEEE. https://doi.org/10.1109/FOCS.2016.88
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

Search

Display / Sort

Citation Style: APA

Export / Embed