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.




51 Publications

2019 | Journal Article | IST-REx-ID: 6596   OA
Shehu Y. 2019. Convergence results of forward-backward algorithms for sum of monotone operators in Banach spaces. Results in Mathematics. 74(4), 138.
View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 6725   OA
Kolmogorov V. 2019. Testing the complexity of a valued CSP language. 46th International Colloquium on Automata, Languages and Programming. ICALP 2019: International Colloquim on Automata, Languages and Programming, LIPIcs, vol. 132. 77:1-77:12.
View | Files available | DOI | arXiv
 
2019 | Journal Article | IST-REx-ID: 6593   OA
Shehu Y, Li X-H, Dong Q-L. 2019. An efficient projection-type method for monotone variational inequalities in Hilbert spaces. Numerical Algorithms., 1–24.
View | Files available | DOI
 
2019 | Journal Article | IST-REx-ID: 6032   OA
Kazda A, Kolmogorov V, Rolinek M. 2019. Even delta-matroids and the complexity of planar boolean CSPs. ACM Transactions on Algorithms. 15(2).
View | DOI | Download (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 193   OA
Alwen JF, Gazi P, Kamath Hosdurg C, Klein K, Osang GF, Pietrzak KZ, Reyzin L, Rolinek M, Rybar M. 2018. On the memory hardness of data independent password hashing functions. Proceedings of the 2018 on Asia Conference on Computer and Communication Security. ASIACCS: Asia Conference on Computer and Communications Security 51–65.
View | DOI | Download (ext.)
 
2018 | Conference Paper | IST-REx-ID: 5978
Haller S, Swoboda P, Savchynskyy B. 2018. Exact MAP-inference by confining combinatorial search with LP relaxation. Proceedings of the 32st AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence 6581–6588.
View
 
2018 | Journal Article | IST-REx-ID: 18   OA
Kolmogorov V, Rolinek M. 2018. Superconcentrators of density 25.3. Ars Combinatoria. 141(10), 269–304.
View | Download (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 5975   OA
Kolmogorov V. 2018. Commutativity in the algorithmic Lovász local lemma. SIAM Journal on Computing. 47(6), 2029–2056.
View | Files available | DOI | Download (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 703   OA
Shekhovtsov A, Swoboda P, Savchynskyy B. 2018. Maximum persistency via iterative relaxed inference with graphical models. IEEE Transactions on Pattern Analysis and Machine Intelligence. 40(7), 1668–1682.
View | DOI | Download (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 273   OA
Mohapatra P, Rolinek M, Jawahar CV, Kolmogorov V, Kumar MP. 2018. Efficient optimization for rank-based loss functions. 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern Recognition 3693–3701.
View | DOI | Download (ext.) | arXiv
 
2018 | Research Data | IST-REx-ID: 5573   OA
Alhaija H, Sellent A, Kondermann D, Rother C. 2018. Graph matching problems for GraphFlow – 6D Large Displacement Scene Flow, IST Austria,p.
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. SODA: Symposium on Discrete Algorithms 307–326.
View | DOI | Download (ext.)
 
2017 | Conference Paper | IST-REx-ID: 915   OA
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.
View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 644   OA
Kolmogorov V, Krokhin A, Rolinek M. 2017. The complexity of general-valued CSPs. SIAM Journal on Computing. 46(3), 1087–1110.
View | Files available | DOI | Download (ext.)
 
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. CVPR: Computer Vision and Pattern Recognition vol. 2017. 7062–7071.
View | Files available | DOI
 
2017 | Thesis | IST-REx-ID: 992   OA
Rolinek M. 2017. Complexity of constraint satisfaction, IST Austria, 97p.
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. CVPR: Computer Vision and Pattern Recognition vol. 2017. 4950–4960.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 641
Trajkovska V, Swoboda P, Åström F, Petra S. 2017. Graphical model parameter learning by inverse linear programming. SSVM: Scale Space and Variational Methods in Computer Vision, LNCS, vol. 10302. 323–334.
View | DOI
 
2017 | Conference Paper | IST-REx-ID: 646   OA
Kuske J, Swoboda P, Petra S. 2017. A novel convex relaxation for non binary discrete tomography. SSVM: Scale Space and Variational Methods in Computer Vision, LNCS, vol. 10302. 235–246.
View | DOI | Download (ext.)
 
2017 | Conference Paper | IST-REx-ID: 274   OA
Kolmogorov V. 2017. A faster approximation algorithm for the Gibbs partition function. COLT: Annual Conference on Learning Theory , COLT, 1–17.
View | Download (ext.)
 

Search

Filter Publications

Display / Sort

Citation Style: IST Annual Report

Export / Embed