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.




47 Publications

2019 | Journal Article | IST-REx-ID: 6596   OA
Shehu, Yekini. “Convergence Results of Forward-Backward Algorithms for Sum of Monotone Operators in Banach Spaces.” Results in Mathematics, vol. 74, no. 4, Springer, 2019, p. 138, doi:10.1007/s00025-019-1061-4.
View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 6725   OA
Kolmogorov, Vladimir. “Testing the Complexity of a Valued CSP Language.” 46th International Colloquium on Automata, Languages and Programming, vol. 132, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 77:1-77:12, doi:10.4230/LIPICS.ICALP.2019.77.
View | Files available | DOI | arXiv
 
2019 | Journal Article | IST-REx-ID: 6593   OA
Shehu, Yekini, et al. “An Efficient Projection-Type Method for Monotone Variational Inequalities in Hilbert Spaces.” Numerical Algorithms, Springer Nature, 2019, pp. 1–24, doi:10.1007/s11075-019-00758-y.
View | Files available | DOI
 
2019 | Journal Article | IST-REx-ID: 6032   OA
Kazda, Alexandr, et al. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs.” ACM Transactions on Algorithms, vol. 15, no. 2, 22, ACM, 2019, doi:10.1145/3230649.
View | DOI | Download (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 193   OA
Alwen, Joel F., et al. “On the Memory Hardness of Data Independent Password Hashing Functions.” Proceedings of the 2018 on Asia Conference on Computer and Communication Security, ACM, 2018, pp. 51–65, doi:10.1145/3196494.3196534.
View | DOI | Download (ext.)
 
2018 | Conference Paper | IST-REx-ID: 5978
Haller, Stefan, et al. “Exact MAP-Inference by Confining Combinatorial Search with LP Relaxation.” Proceedings of the 32st AAAI Conference on Artificial Intelligence, AAAI, 2018, pp. 6581–88.
View
 
2018 | Journal Article | IST-REx-ID: 18   OA
Kolmogorov, Vladimir, and Michal Rolinek. “Superconcentrators of Density 25.3.” Ars Combinatoria, vol. 141, no. 10, Charles Babbage Research Centre, 2018, pp. 269–304.
View | Download (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 5975   OA
Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovász Local Lemma.” SIAM Journal on Computing, vol. 47, no. 6, Society for Industrial & Applied Mathematics (SIAM), 2018, pp. 2029–56, doi:10.1137/16m1093306.
View | Files available | DOI | Download (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 703   OA
Shekhovtsov, Alexander, et al. “Maximum Persistency via Iterative Relaxed Inference with Graphical Models.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 40, no. 7, IEEE, 2018, pp. 1668–82, doi:10.1109/TPAMI.2017.2730884.
View | DOI | Download (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 273   OA
Mohapatra, Pritish, et al. “Efficient Optimization for Rank-Based Loss Functions.” 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2018, pp. 3693–701, doi:10.1109/cvpr.2018.00389.
View | DOI | Download (ext.) | arXiv
 
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 | DOI | Download (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 | 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 (ext.)
 
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 | 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: 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 | 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 | 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 (ext.)
 
2017 | Conference Paper | IST-REx-ID: 274   OA
Kolmogorov, Vladimir. A Faster Approximation Algorithm for the Gibbs Partition Function. Unknown, 2017, pp. 1–17.
View | Download (ext.)
 
2016 | Conference Paper | IST-REx-ID: 1231   OA
Alwen, Joel F., et al. On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model. Vol. 9666, Springer, 2016, pp. 358–87, doi:10.1007/978-3-662-49896-5_13.
View | DOI | Download (ext.)
 
2016 | Journal Article | IST-REx-ID: 1612   OA
Kazda, Alexandr. “CSP for Binary Conservative Relational Structures.” Algebra Universalis, vol. 75, no. 1, Springer, 2016, pp. 75–84, doi:10.1007/s00012-015-0358-8.
View | DOI | Download (ext.)
 
2016 | Journal Article | IST-REx-ID: 1794
Kolmogorov, Vladimir, and Rustem Takhanov. “Inference Algorithms for Pattern-Based CRFs on Sequence Data.” Algorithmica, vol. 76, no. 1, Springer, 2016, pp. 17–46, doi:10.1007/s00453-015-0017-7.
View | Files available | DOI | Download (ext.) | arXiv
 
2016 | Conference Paper | IST-REx-ID: 1193
Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovasz Local Lemma.” Proceedings - Annual IEEE Symposium on Foundations of Computer Science, vol. 2016–December, 7782993, IEEE, 2016, doi:10.1109/FOCS.2016.88.
View | Files available | DOI | Download (ext.)
 
2016 | Journal Article | IST-REx-ID: 1377   OA
Kolmogorov, Vladimir, et al. “Total Variation on a Tree.” SIAM Journal on Imaging Sciences, vol. 9, no. 2, Society for Industrial and Applied Mathematics , 2016, pp. 605–36, doi:10.1137/15M1010257.
View | DOI | Download (ext.)
 
2016 | Journal Article | IST-REx-ID: 1353   OA
Barto, Libor, and Alexandr Kazda. “Deciding Absorption.” International Journal of Algebra and Computation, vol. 26, no. 5, World Scientific Publishing, 2016, pp. 1033–60, doi:10.1142/S0218196716500430.
View | DOI | Download (ext.)
 
2015 | Conference Paper | IST-REx-ID: 1636   OA
Kolmogorov, Vladimir, et al. Effectiveness of Structural Restrictions for Hybrid CSPs. Vol. 9472, Springer, 2015, pp. 566–77, doi:10.1007/978-3-662-48971-0_48.
View | DOI | Download (ext.)
 
2015 | Journal Article | IST-REx-ID: 1841   OA
Kolmogorov, Vladimir. “A New Look at Reweighted Message Passing.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 37, no. 5, IEEE, 2015, pp. 919–30, doi:10.1109/TPAMI.2014.2363465.
View | DOI | Download (ext.)
 
2015 | Conference Paper | IST-REx-ID: 1637
Kolmogorov, Vladimir, et al. The Complexity of General-Valued CSPs. IEEE, 2015, pp. 1246–58, doi:10.1109/FOCS.2015.80.
View | Files available | DOI | Download (ext.)
 
2015 | Conference Paper | IST-REx-ID: 1675
Dziembowski, Stefan, et al. Proofs of Space. Vol. 9216, Springer, 2015, pp. 585–605, doi:10.1007/978-3-662-48000-7_29.
View | Files available | DOI
 
2015 | Conference Paper | IST-REx-ID: 1859   OA
Shah, Neel, et al. A Multi-Plane Block-Coordinate Frank-Wolfe Algorithm for Training Structural SVMs with a Costly Max-Oracle. IEEE, 2015, pp. 2737–45, doi:10.1109/CVPR.2015.7298890.
View | DOI | Download (ext.)
 
2015 | Journal Article | IST-REx-ID: 2271
Kolmogorov, Vladimir, et al. “The Power of Linear Programming for General-Valued CSPs.” SIAM Journal on Computing, vol. 44, no. 1, SIAM, 2015, pp. 1–36, doi:10.1137/130945648.
View | Files available | DOI | Download (ext.) | arXiv
 
2014 | Conference Paper | IST-REx-ID: 2275   OA
Olsson, Carl, et al. Partial Enumeration and Curvature Regularization. IEEE, 2014, pp. 2936–43, doi:10.1109/ICCV.2013.365.
View | Files available | DOI
 
2013 | Conference Paper | IST-REx-ID: 2272   OA
Takhanov, Rustem, and Vladimir Kolmogorov. “Inference Algorithms for Pattern-Based CRFs on Sequence Data.” ICML’13 Proceedings of the 30th International Conference on International, vol. 28, no. 3, International Machine Learning Society, 2013, pp. 145–53.
View | Files available | Download (ext.)
 
2013 | Conference Paper | IST-REx-ID: 2518   OA
Kolmogorov, Vladimir. The Power of Linear Programming for Finite-Valued CSPs: A Constructive Characterization. Vol. 7965, no. 1, Springer, 2013, pp. 625–36, doi:10.1007/978-3-642-39206-1_53.
View | Files available | DOI | Download (ext.) | arXiv
 
2013 | Journal Article | IST-REx-ID: 2828   OA
Kolmogorov, Vladimir, and Stanislav Živný. “The Complexity of Conservative Valued CSPs.” Journal of the ACM, vol. 60, no. 2, 10, ACM, 2013, doi:10.1145/2450142.2450146.
View | DOI | Download (ext.) | arXiv
 
2013 | Report | IST-REx-ID: 2273   OA
Kolmogorov, Vladimir. Reweighted Message Passing Revisited. IST Austria, 2013.
View | Download (ext.)
 
2013 | Conference Paper | IST-REx-ID: 2901   OA
Chen, Chao, et al. Computing the M Most Probable Modes of a Graphical Model. Vol. 31, JMLR, 2013, pp. 161–69.
View | Download (ext.)
 
2013 | Report | IST-REx-ID: 2274   OA
Dziembowski, Stefan, et al. Proofs of Space. IST Austria, 2013.
View | Files available
 
2013 | Conference Paper | IST-REx-ID: 2270   OA
Bachrach, Yoram, et al. Optimal Coalition Structures in Cooperative Graph Games. AAAI Press, 2013, pp. 81–87.
View | Download (ext.) | arXiv
 
2013 | Conference Paper | IST-REx-ID: 2276   OA
Gridchyn, Igor, and Vladimir Kolmogorov. Potts Model, Parametric Maxflow and k-Submodular Functions. IEEE, 2013, pp. 2320–27, doi:10.1109/ICCV.2013.288.
View | DOI | Download (ext.) | arXiv
 
2012 | Journal Article | IST-REx-ID: 2931
Torresani, Lorenzo, et al. “A Dual Decomposition Approach to Feature Correspondence.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 35, no. 2, IEEE, 2012, pp. 259–71, doi:10.1109/TPAMI.2012.105.
View | DOI
 
2012 | Journal Article | IST-REx-ID: 3117   OA
Kolmogorov, Vladimir. “Minimizing a Sum of Submodular Functions.” Discrete Applied Mathematics, vol. 160, no. 15, Elsevier, 2012, pp. 2246–58, doi:10.1016/j.dam.2012.05.025.
View | DOI | Download (ext.)
 
2012 | Conference Paper | IST-REx-ID: 3124
Korc, Filip, et al. Approximating Marginals Using Discrete Energy Minimization. ICML, 2012.
View | Files available
 
2012 | Technical Report | IST-REx-ID: 5396   OA
Korc, Filip, et al. Approximating Marginals Using Discrete Energy Minimization. IST Austria, 2012, doi:10.15479/AT:IST-2012-0003.
View | Files available | DOI
 
2012 | Journal Article | IST-REx-ID: 3257   OA
Kolmogorov, Vladimir. “Generalized Roof Duality and Bisubmodular Functions.” Discrete Applied Mathematics, vol. 160, no. 4–5, Elsevier, 2012, pp. 416–26, doi:10.1016/j.dam.2011.10.026.
View | Files available | DOI | Download (ext.) | arXiv
 
2012 | Conference Paper | IST-REx-ID: 2930   OA
Huber, Anna, and Vladimir Kolmogorov. Towards Minimizing K-Submodular Functions. Vol. 7422, Springer, 2012, pp. 451–62, doi:10.1007/978-3-642-32147-4_40.
View | DOI | Download (ext.)
 
2012 | Preprint | IST-REx-ID: 2928   OA
Kolmogorov, Vladimir, and Thomas Schoenemann. “Generalized Sequential Tree-Reweighted Message Passing.” ArXiv, ArXiv, 2012.
View | Download (ext.) | arXiv
 

Filters and Search Terms

type<>research_data

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed