Discrete Optimization in Computer Vision: Theory and Practice

Project Period: 2014-06-01 – 2020-05-31
Externally Funded
Acronym
DOiCV
Principal Investigator
Vladimir Kolmogorov
Department(s)
Kolmogorov Group
Grant Number
616160
Funding Organisation
FP7_ERC

23 Publications

2017 | Conference Paper | IST-REx-ID: 274   OA
A faster approximation algorithm for the Gibbs partition function
V. Kolmogorov, in:, Unknown, 2017, pp. 1–17.
View | Download (ext.)
 
2017 | Conference Paper | IST-REx-ID: 1192   OA
Even delta-matroids and the complexity of planar Boolean CSPs
A. Kazda, V. Kolmogorov, M. Rolinek, in:, SIAM, 2017, pp. 307–326.
View | DOI | Download (ext.)
 
2016 | Conference Paper | IST-REx-ID: 1231   OA
On the complexity of scrypt and proofs of space in the parallel random oracle model
J.F. Alwen, B. Chen, C. Kamath Hosdurg, V. Kolmogorov, K.Z. Pietrzak, S. Tessaro, in:, Springer, 2016, pp. 358–387.
View | DOI | Download (ext.)
 
2018 | Conference Paper | IST-REx-ID: 193   OA
On the memory hardness of data independent password hashing functions
J.F. Alwen, P. Gazi, C. Kamath Hosdurg, K. Klein, G.F. Osang, K.Z. Pietrzak, L. Reyzin, M. Rolinek, M. Rybar, in:, Proceedings of the 2018 on Asia Conference on Computer and Communication Security, ACM, 2018, pp. 51–65.
View | DOI | Download (ext.)
 
2017 | Conference Paper | IST-REx-ID: 915   OA
A message passing algorithm for the minimum cost multicut problem
P. Swoboda, B. Andres, in:, IEEE, 2017, pp. 4990–4999.
View | Files available | DOI
 
2015 | Conference Paper | IST-REx-ID: 1859   OA
A multi-plane block-coordinate Frank-Wolfe algorithm for training structural SVMs with a costly max-oracle
N. Shah, V. Kolmogorov, C. Lampert, in:, IEEE, 2015, pp. 2737–2745.
View | DOI | Download (ext.)
 
2018 | Conference Paper | IST-REx-ID: 273   OA
Efficient optimization for rank-based loss functions
P. Mohapatra, M. Rolinek, C.V. Jawahar, V. Kolmogorov, M.P. Kumar, in:, 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2018, pp. 3693–3701.
View | DOI | Download (ext.) | arXiv
 
2019 | Journal Article | IST-REx-ID: 6032   OA
Even delta-matroids and the complexity of planar boolean CSPs
A. Kazda, V. Kolmogorov, M. Rolinek, ACM Transactions on Algorithms 15 (2019).
View | DOI | Download (ext.) | arXiv
 
2017 | Conference Paper | IST-REx-ID: 646   OA
A novel convex relaxation for non binary discrete tomography
J. Kuske, P. Swoboda, S. Petra, in:, F. Lauze, Y. Dong, A. Bjorholm Dahl (Eds.), Springer, 2017, pp. 235–246.
View | DOI | Download (ext.)
 
2016 | Journal Article | IST-REx-ID: 1377   OA
Total variation on a tree
V. Kolmogorov, T. Pock, M. Rolinek, SIAM Journal on Imaging Sciences 9 (2016) 605–636.
View | DOI | Download (ext.)
 
2015 | Journal Article | IST-REx-ID: 1841   OA
A new look at reweighted message passing
V. Kolmogorov, IEEE Transactions on Pattern Analysis and Machine Intelligence 37 (2015) 919–930.
View | DOI | Download (ext.)
 
2015 | Conference Paper | IST-REx-ID: 1675
Proofs of space
S. Dziembowski, S. Faust, V. Kolmogorov, K.Z. Pietrzak, 9216 (2015) 585–605.
View | Files available | DOI
 
2018 | Journal Article | IST-REx-ID: 5975   OA
Commutativity in the algorithmic Lovász local lemma
V. Kolmogorov, SIAM Journal on Computing 47 (2018) 2029–2056.
View | Files available | DOI | Download (ext.) | arXiv
 
2015 | Conference Paper | IST-REx-ID: 1637
The complexity of general-valued CSPs
V. Kolmogorov, A. Krokhin, M. Rolinek, in:, IEEE, 2015, pp. 1246–1258.
View | Files available | DOI | Download (ext.)
 
2019 | Journal Article | IST-REx-ID: 6593   OA
An efficient projection-type method for monotone variational inequalities in Hilbert spaces
Y. Shehu, X.-H. Li, Q.-L. Dong, Numerical Algorithms (2019) 1–24.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 917   OA
A dual ascent framework for Lagrangean decomposition of combinatorial problems
P. Swoboda, J. Kuske, B. Savchynskyy, in:, IEEE, 2017, pp. 4950–4960.
View | Files available | DOI
 
2015 | Conference Paper | IST-REx-ID: 1636   OA
Effectiveness of structural restrictions for hybrid CSPs
V. Kolmogorov, M. Rolinek, R. Takhanov, 9472 (2015) 566–577.
View | DOI | Download (ext.)
 
2016 | Journal Article | IST-REx-ID: 1794
Inference algorithms for pattern-based CRFs on sequence data
V. Kolmogorov, R. Takhanov, Algorithmica 76 (2016) 17–46.
View | Files available | DOI | Download (ext.) | arXiv
 
2016 | Conference Paper | IST-REx-ID: 1193
Commutativity in the algorithmic Lovasz local lemma
V. Kolmogorov, in:, Proceedings - Annual IEEE Symposium on Foundations of Computer Science, IEEE, 2016.
View | Files available | DOI | Download (ext.)
 
2017 | Journal Article | IST-REx-ID: 644   OA
The complexity of general-valued CSPs
V. Kolmogorov, A. Krokhin, M. Rolinek, SIAM Journal on Computing 46 (2017) 1087–1110.
View | Files available | DOI | Download (ext.)
 
2019 | Conference Paper | IST-REx-ID: 6725   OA
Testing the complexity of a valued CSP language
V. Kolmogorov, in:, 46th International Colloquium on Automata, Languages and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 77:1-77:12.
View | Files available | DOI | arXiv
 
2017 | Conference Paper | IST-REx-ID: 916   OA
A study of lagrangean decompositions and dual ascent solvers for graph matching
P. Swoboda, C. Rother, C. Abu Alhaija, D. Kainmueller, B. Savchynskyy, in:, IEEE, 2017, pp. 7062–7071.
View | Files available | DOI
 
2017 | Thesis | IST-REx-ID: 992   OA
Complexity of constraint satisfaction
M. Rolinek, Complexity of Constraint Satisfaction, IST Austria, 2017.
View | Files available | DOI