Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

75 Publications


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.
[Submitted Version] View | Files available | DOI | WoS
 

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.
[Submitted Version] View | Files available | DOI | WoS
 

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.
[Submitted Version] View | Files available | DOI | WoS
 

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.
[Published Version] View | Files available | 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.” Institute of Science and Technology Austria, 2017.
[Published Version] View | Files available | DOI
 

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.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2016 | Journal Article | IST-REx-ID: 1353 | OA
L. Barto and A. Kazda, “Deciding absorption,” International Journal of Algebra and Computation, vol. 26, no. 5. World Scientific Publishing, pp. 1033–1060, 2016.
[Preprint] View | DOI | Download Preprint (ext.)
 

2016 | Journal Article | IST-REx-ID: 1377 | OA
V. Kolmogorov, T. Pock, and M. Rolinek, “Total variation on a tree,” SIAM Journal on Imaging Sciences, vol. 9, no. 2. Society for Industrial and Applied Mathematics , pp. 605–636, 2016.
[Preprint] View | DOI | Download Preprint (ext.)
 

2016 | Journal Article | IST-REx-ID: 1612 | OA
A. Kazda, “CSP for binary conservative relational structures,” Algebra Universalis, vol. 75, no. 1. Springer, pp. 75–84, 2016.
[Preprint] View | DOI | Download Preprint (ext.)
 

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.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

Filters and Search Terms

department=VlKo

Search

Filter Publications