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

2018 | Conference Paper | IST-REx-ID: 273 | OA
P. Mohapatra, M. Rolinek, C. V. Jawahar, V. Kolmogorov, and M. P. Kumar, “Efficient optimization for rank-based loss functions,” in 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, Salt Lake City, UT, USA, 2018, pp. 3693–3701.
View | DOI | Download Preprint (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 703 | OA
A. Shekhovtsov, P. Swoboda, and B. Savchynskyy, “Maximum persistency via iterative relaxed inference with graphical models,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 40, no. 7, pp. 1668–1682, 2018.
View | DOI | Download Preprint (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 18 | OA
V. Kolmogorov and M. Rolinek, “Superconcentrators of density 25.3,” Ars Combinatoria, vol. 141, no. 10, pp. 269–304, 2018.
View | Download Preprint (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 193 | OA
J. F. Alwen et al., “On the memory hardness of data independent password hashing functions,” in Proceedings of the 2018 on Asia Conference on Computer and Communication Security, Incheon, Republic of Korea, 2018, pp. 51–65.
View | DOI | Download Submitted Version (ext.)
 
2018 | Conference Paper | IST-REx-ID: 5978 | OA
S. Haller, P. Swoboda, and B. Savchynskyy, “Exact MAP-inference by confining combinatorial search with LP relaxation,” in Proceedings of the 32st AAAI Conference on Artificial Intelligence, New Orleans, LU, United States, 2018, pp. 6581–6588.
View | Download Preprint (ext.) | arXiv
 
2017 | Research Data | IST-REx-ID: 5561 | OA
D. Kainmueller, F. Jug, C. Rother, and G. Meyers, Graph matching problems for annotating C. Elegans. IST Austria, 2017.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 274 | OA
V. Kolmogorov, “A faster approximation algorithm for the Gibbs partition function,” in Proceedings of the 31st Conference On Learning Theory, 2017, vol. 75, pp. 228–249.
View | Files available | arXiv
 
2017 | Conference Paper | IST-REx-ID: 641
V. Trajkovska, P. Swoboda, F. Åström, and S. Petra, “Graphical model parameter learning by inverse linear programming,” presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark, 2017, vol. 10302, pp. 323–334.
View | DOI
 
2017 | Journal Article | IST-REx-ID: 644 | OA
V. Kolmogorov, A. Krokhin, and M. Rolinek, “The complexity of general-valued CSPs,” SIAM Journal on Computing, vol. 46, no. 3, pp. 1087–1110, 2017.
View | Files available | DOI | Download Preprint (ext.)
 
2017 | Conference Paper | IST-REx-ID: 646 | OA
J. Kuske, P. Swoboda, and S. Petra, “A novel convex relaxation for non binary discrete tomography,” presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark, 2017, vol. 10302, pp. 235–246.
View | DOI | Download Submitted Version (ext.)
 
2017 | Conference Paper | IST-REx-ID: 915 | OA
P. Swoboda and B. Andres, “A message passing algorithm for the minimum cost multicut problem,” presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States, 2017, vol. 2017, pp. 4990–4999.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 916 | OA
P. Swoboda, C. Rother, C. Abu Alhaija, D. Kainmueller, and B. Savchynskyy, “A study of lagrangean decompositions and dual ascent solvers for graph matching,” presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States, 2017, vol. 2017, pp. 7062–7071.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 917 | OA
P. Swoboda, J. Kuske, and B. Savchynskyy, “A dual ascent framework for Lagrangean decomposition of combinatorial problems,” presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States, 2017, vol. 2017, pp. 4950–4960.
View | Files available | DOI
 
2017 | Thesis | IST-REx-ID: 992 | OA
M. Rolinek, Complexity of constraint satisfaction. IST Austria, 2017.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 1192 | OA
A. Kazda, V. Kolmogorov, and M. Rolinek, “Even delta-matroids and the complexity of planar Boolean CSPs,” presented at the SODA: Symposium on Discrete Algorithms, Barcelona, Spain, 2017, pp. 307–326.
View | Files available | DOI | Download Submitted Version (ext.)
 
2016 | Research Data | IST-REx-ID: 5557 | OA
P. Swoboda, Synthetic discrete tomography problems. IST Austria, 2016.
View | Files available | DOI
 
2016 | Journal Article | IST-REx-ID: 1612 | OA
A. Kazda, “CSP for binary conservative relational structures,” Algebra Universalis, vol. 75, no. 1, pp. 75–84, 2016.
View | DOI | Download Preprint (ext.)
 
2016 | Journal Article | IST-REx-ID: 1794 | OA
V. Kolmogorov and R. Takhanov, “Inference algorithms for pattern-based CRFs on sequence data,” Algorithmica, vol. 76, no. 1, pp. 17–46, 2016.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2016 | Conference Paper | IST-REx-ID: 1193 | OA
V. Kolmogorov, “Commutativity in the algorithmic Lovasz local lemma,” in Proceedings - Annual IEEE Symposium on Foundations of Computer Science, New Brunswick, NJ, USA , 2016, vol. 2016–December, p. 7782993.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2016 | Conference Paper | IST-REx-ID: 1231 | OA
J. F. Alwen, B. Chen, C. Kamath Hosdurg, V. Kolmogorov, K. Z. Pietrzak, and S. Tessaro, “On the complexity of scrypt and proofs of space in the parallel random oracle model,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Vienna, Austria, 2016, vol. 9666, pp. 358–387.
View | DOI | Download Submitted Version (ext.)
 

Search

Display / Sort

Citation Style: IEEE

Export / Embed