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 | Conference Paper | IST-REx-ID: 274 | OA
Kolmogorov V. 2017. A faster approximation algorithm for the Gibbs partition function. Proceedings of the 31st Conference On Learning Theory. COLT: Annual Conference on Learning Theory vol. 75. 228–249.
View | Files available | arXiv
 
2017 | Research Data | IST-REx-ID: 5561 | OA
Kainmueller D, Jug F, Rother C, Meyers G. 2017. Graph matching problems for annotating C. Elegans, IST Austria,p.
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 | 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 Preprint (ext.)
 
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 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. CVPR: Computer Vision and Pattern Recognition vol. 2017. 4990–4999.
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. CVPR: Computer Vision and Pattern Recognition vol. 2017. 7062–7071.
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 | 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: 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 | Files available | DOI | Download Submitted Version (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.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2016 | Research Data | IST-REx-ID: 5557 | OA
Swoboda P. 2016. Synthetic discrete tomography problems, IST Austria,p.
View | Files available | DOI
 
2016 | Conference Paper | IST-REx-ID: 1193 | OA
Kolmogorov V. 2016. Commutativity in the algorithmic Lovasz local lemma. Proceedings - Annual IEEE Symposium on Foundations of Computer Science. FOCS: Foundations of Computer Science vol. 2016–December. 7782993.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2016 | Conference Paper | IST-REx-ID: 1231 | OA
Alwen JF, Chen B, Kamath Hosdurg C, Kolmogorov V, Pietrzak KZ, Tessaro S. 2016. On the complexity of scrypt and proofs of space in the parallel random oracle model. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 9666. 358–387.
View | DOI | Download Submitted Version (ext.)
 
2016 | Journal Article | IST-REx-ID: 1353 | OA
Barto L, Kazda A. 2016. Deciding absorption. International Journal of Algebra and Computation. 26(5), 1033–1060.
View | DOI | Download Preprint (ext.)
 
2016 | Journal Article | IST-REx-ID: 1377 | OA
Kolmogorov V, Pock T, Rolinek M. 2016. Total variation on a tree. SIAM Journal on Imaging Sciences. 9(2), 605–636.
View | DOI | Download Preprint (ext.)
 
2016 | Journal Article | IST-REx-ID: 1612 | OA
Kazda A. 2016. CSP for binary conservative relational structures. Algebra Universalis. 75(1), 75–84.
View | DOI | Download Preprint (ext.)
 
2015 | Conference Paper | IST-REx-ID: 1636 | OA
Kolmogorov V, Rolinek M, Takhanov R. 2015. Effectiveness of structural restrictions for hybrid CSPs. 9472, 566–577.
View | DOI | Download Preprint (ext.)
 
2015 | Conference Paper | IST-REx-ID: 1637 | OA
Kolmogorov V, Krokhin A, Rolinek M. 2015. The complexity of general-valued CSPs. FOCS: Foundations of Computer Science, 56th Annual Symposium on Foundations of Computer Science, 1246–1258.
View | Files available | DOI | Download Preprint (ext.)
 
2015 | Conference Paper | IST-REx-ID: 1675
Dziembowski S, Faust S, Kolmogorov V, Pietrzak KZ. 2015. Proofs of space. 9216, 585–605.
View | Files available | DOI
 
2015 | Journal Article | IST-REx-ID: 1841 | OA
Kolmogorov V. 2015. A new look at reweighted message passing. IEEE Transactions on Pattern Analysis and Machine Intelligence. 37(5), 919–930.
View | DOI | Download Preprint (ext.)
 
2015 | Conference Paper | IST-REx-ID: 1859 | OA
Shah N, Kolmogorov V, Lampert C. 2015. A multi-plane block-coordinate Frank-Wolfe algorithm for training structural SVMs with a costly max-oracle. CVPR: Computer Vision and Pattern Recognition 2737–2745.
View | DOI | Download Preprint (ext.)
 
2015 | Journal Article | IST-REx-ID: 2271 | OA
Kolmogorov V, Thapper J, Živný S. 2015. The power of linear programming for general-valued CSPs. SIAM Journal on Computing. 44(1), 1–36.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2014 | Conference Paper | IST-REx-ID: 2275 | OA
Olsson C, Ulen J, Boykov Y, Kolmogorov V. 2014. Partial enumeration and curvature regularization. ICCV: International Conference on Computer Vision 2936–2943.
View | Files available | DOI
 
2014 | Working Paper | IST-REx-ID: 7038 | OA
Huszár K, Rolinek M. Playful Math - An introduction to mathematical games, IST Austria, 5p.
View | Files available
 
2013 | Conference Paper | IST-REx-ID: 2270 | OA
Bachrach Y, Kohli P, Kolmogorov V, Zadimoghaddam M. 2013. Optimal Coalition Structures in Cooperative Graph Games. AAAI: Conference on Artificial Intelligence 81–87.
View | Download None (ext.) | arXiv
 
2013 | Conference Paper | IST-REx-ID: 2272 | OA
Takhanov R, Kolmogorov V. 2013. Inference algorithms for pattern-based CRFs on sequence data. ICML’13 Proceedings of the 30th International Conference on International. ICML: International Conference on Machine Learning, JMLR, vol. 28. 145–153.
View | Files available | Download Submitted Version (ext.)
 
2013 | Report | IST-REx-ID: 2273 | OA
Kolmogorov V. 2013. Reweighted message passing revisited, IST Austria,p.
View | Download (ext.)
 
2013 | Report | IST-REx-ID: 2274 | OA
Dziembowski S, Faust S, Kolmogorov V, Pietrzak KZ. 2013. Proofs of Space, IST Austria,p.
View | Files available
 
2013 | Conference Paper | IST-REx-ID: 2276 | OA
Gridchyn I, Kolmogorov V. 2013. Potts model, parametric maxflow and k-submodular functions. ICCV: International Conference on Computer Vision 2320–2327.
View | DOI | Download Preprint (ext.) | arXiv
 
2013 | Conference Paper | IST-REx-ID: 2518 | OA
Kolmogorov V. 2013. The power of linear programming for finite-valued CSPs: A constructive characterization. ICALP: Automata, Languages and Programming, LNCS, vol. 7965. 625–636.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2013 | Journal Article | IST-REx-ID: 2828 | OA
Kolmogorov V, Živný S. 2013. The complexity of conservative valued CSPs. Journal of the ACM. 60(2), 10.
View | DOI | Download Preprint (ext.) | arXiv
 
2013 | Conference Paper | IST-REx-ID: 2901 | OA
Chen C, Kolmogorov V, Yan Z, Metaxas D, Lampert C. 2013. Computing the M most probable modes of a graphical model. AISTATS: Conference on Uncertainty in Artificial Intelligence, JMLR: W&CP, vol. 31. 161–169.
View | Download None (ext.)
 
2012 | Technical Report | IST-REx-ID: 5396 | OA
Korc F, Kolmogorov V, Lampert C. 2012. Approximating marginals using discrete energy minimization, IST Austria, 13p.
View | Files available | DOI
 
2012 | Preprint | IST-REx-ID: 2928 | OA
Kolmogorov V, Schoenemann T. 2012. Generalized sequential tree-reweighted message passing. arXiv.
View | Download Preprint (ext.) | arXiv
 
2012 | Conference Paper | IST-REx-ID: 2930 | OA
Huber A, Kolmogorov V. 2012. Towards minimizing k-submodular functions. ISCO: International Symposium on Combinatorial Optimization, LNCS, vol. 7422. 451–462.
View | DOI | Download Preprint (ext.)
 
2012 | Journal Article | IST-REx-ID: 2931
Torresani L, Kolmogorov V, Rother C. 2012. A dual decomposition approach to feature correspondence. IEEE Transactions on Pattern Analysis and Machine Intelligence. 35(2), 259–271.
View | DOI
 
2012 | Journal Article | IST-REx-ID: 3117 | OA
Kolmogorov V. 2012. Minimizing a sum of submodular functions. Discrete Applied Mathematics. 160(15), 2246–2258.
View | DOI | Download Preprint (ext.)
 
2012 | Conference Paper | IST-REx-ID: 3124 | OA
Korc F, Kolmogorov V, Lampert C. 2012. Approximating marginals using discrete energy minimization. ICML: International Conference on Machine Learning, Inferning 2012,
View | Files available
 
2012 | Journal Article | IST-REx-ID: 3257 | OA
Kolmogorov V. 2012. Generalized roof duality and bisubmodular functions. Discrete Applied Mathematics. 160(4–5), 416–426.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

Search

Filter Publications