85 Publications

Mark all

[85]
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
 
[84]
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
 
[83]
2018 | Journal Article | IST-REx-ID: 18   OA
Superconcentrators of density 25.3
V. Kolmogorov, M. Rolinek, Ars Combinatoria 141 (2018) 269–304.
View | Download (ext.) | arXiv
 
[82]
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
 
[81]
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
 
[80]
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.)
 
[79]
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.)
 
[78]
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.)
 
[77]
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.)
 
[76]
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
 
[75]
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.)
 
[74]
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.)
 
[73]
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.)
 
[72]
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.)
 
[71]
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.)
 
[70]
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
 
[69]
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.)
 
[68]
2015 | Journal Article | IST-REx-ID: 2271
The power of linear programming for general-valued CSPs
V. Kolmogorov, J. Thapper, S. Živný, SIAM Journal on Computing 44 (2015) 1–36.
View | Files available | DOI | Download (ext.) | arXiv
 
[67]
2014 | Conference Paper | IST-REx-ID: 2275   OA
Partial enumeration and curvature regularization
C. Olsson, J. Ulen, Y. Boykov, V. Kolmogorov, in:, IEEE, 2014, pp. 2936–2943.
View | Files available | DOI
 
[66]
2013 | Conference Paper | IST-REx-ID: 2272   OA
Inference algorithms for pattern-based CRFs on sequence data
R. Takhanov, V. Kolmogorov, in:, ICML’13 Proceedings of the 30th International Conference on International, International Machine Learning Society, 2013, pp. 145–153.
View | Files available | Download (ext.)
 
[65]
2013 | Conference Paper | IST-REx-ID: 2518   OA View | Files available | DOI | Download (ext.) | arXiv
 
[64]
2013 | Journal Article | IST-REx-ID: 2828   OA
The complexity of conservative valued CSPs
V. Kolmogorov, S. Živný, Journal of the ACM 60 (2013).
View | DOI | Download (ext.) | arXiv
 
[63]
2013 | Report | IST-REx-ID: 2273   OA
Reweighted message passing revisited
V. Kolmogorov, Reweighted Message Passing Revisited, IST Austria, 2013.
View | Download (ext.)
 
[62]
2013 | Conference Paper | IST-REx-ID: 2901   OA
Computing the M most probable modes of a graphical model
C. Chen, V. Kolmogorov, Z. Yan, D. Metaxas, C. Lampert, in:, JMLR, 2013, pp. 161–169.
View | Download (ext.)
 
[61]
2013 | Report | IST-REx-ID: 2274   OA
Proofs of Space
S. Dziembowski, S. Faust, V. Kolmogorov, K.Z. Pietrzak, Proofs of Space, IST Austria, 2013.
View | Files available
 
[60]
2013 | Conference Paper | IST-REx-ID: 2270   OA
Optimal Coalition Structures in Cooperative Graph Games
Y. Bachrach, P. Kohli, V. Kolmogorov, M. Zadimoghaddam, in:, AAAI Press, 2013, pp. 81–87.
View | Download (ext.) | arXiv
 
[59]
2013 | Conference Paper | IST-REx-ID: 2276   OA
Potts model, parametric maxflow and k-submodular functions
I. Gridchyn, V. Kolmogorov, in:, IEEE, 2013, pp. 2320–2327.
View | DOI | Download (ext.) | arXiv
 
[58]
2012 | Report | IST-REx-ID: 2929   OA
The power of linear programming for valued CSPs: a constructive characterization
V. Kolmogorov, The Power of Linear Programming for Valued CSPs: A Constructive Characterization, Unknown, 2012.
View | Download (ext.)
 
[57]
2012 | Journal Article | IST-REx-ID: 2931
A dual decomposition approach to feature correspondence
L. Torresani, V. Kolmogorov, C. Rother, IEEE Transactions on Pattern Analysis and Machine Intelligence 35 (2012) 259–271.
View | DOI
 
[56]
2012 | Journal Article | IST-REx-ID: 3117   OA
Minimizing a sum of submodular functions
V. Kolmogorov, Discrete Applied Mathematics 160 (2012) 2246–2258.
View | DOI | Download (ext.)
 
[55]
2012 | Conference Paper | IST-REx-ID: 3124
Approximating marginals using discrete energy minimization
F. Korc, V. Kolmogorov, C. Lampert, in:, ICML, 2012.
View | Files available
 
[54]
2012 | Technical Report | IST-REx-ID: 5396   OA
Approximating marginals using discrete energy minimization
F. Korc, V. Kolmogorov, C. Lampert, Approximating Marginals Using Discrete Energy Minimization, IST Austria, 2012.
View | Files available | DOI
 
[53]
2012 | Journal Article | IST-REx-ID: 3257   OA
Generalized roof duality and bisubmodular functions
V. Kolmogorov, Discrete Applied Mathematics 160 (2012) 416–426.
View | Files available | DOI | Download (ext.) | arXiv
 
[52]
2012 | Conference Paper | IST-REx-ID: 3284   OA
The complexity of conservative valued CSPs
V. Kolmogorov, S. Živný, in:, SIAM, 2012, pp. 750–759.
View | Download (ext.)
 
[51]
2012 | Conference Paper | IST-REx-ID: 2930   OA
Towards minimizing k-submodular functions
A. Huber, V. Kolmogorov, in:, Springer, 2012, pp. 451–462.
View | DOI | Download (ext.)
 
[50]
2012 | Preprint | IST-REx-ID: 2928   OA
Generalized sequential tree-reweighted message passing
V. Kolmogorov, T. Schoenemann, ArXiv (2012).
View | Download (ext.) | arXiv
 
[49]
2011 | Book Chapter | IST-REx-ID: 2924
Bilayer Segmentation of Video
A. Criminisi, G. Cross, A. Blake, V. Kolmogorov, in:, A. Blake, P. Kohli, C. Rother (Eds.), Markov Random Fields for Vision and Image Processing, Massachusetts Institute of Technology Press, 2011.
View
 
[48]
2011 | Conference Paper | IST-REx-ID: 3206
Submodular decomposition framework for inference in associative Markov networks with global constraints
A. Osokin, D. Vetrov, V. Kolmogorov, in:, IEEE, 2011, pp. 1889–1896.
View | DOI | Download (ext.)
 
[47]
2011 | Book Chapter | IST-REx-ID: 2925
Interactive Foreground Extraction using graph cut
C. Rother, V. Kolmogorov, Y. Boykov, A. Blake, in:, A. Blake, P. Kohli, C. Rother (Eds.), Markov Random Fields for Vision and Image Processing, Massachusetts Institute of Technology Press, 2011.
View
 
[46]
2011 | Conference Paper | IST-REx-ID: 3207
Object cosegmentation
S. Vicente, C. Rother, V. Kolmogorov, in:, IEEE, 2011, pp. 2217–2224.
View | DOI
 
[45]
2011 | Book Chapter | IST-REx-ID: 2922
Graph-cut Based Image Segmentation with Connectivity Priors
S. Vicente, V. Kolmogorov, C. Rother, in:, A. Blake, P. Kohli, C. Rother (Eds.), Markov Random Fields for Vision and Image Processing, Massachusetts Institute of Technology Press, 2011.
View
 
[44]
 
[43]
2011 | Book Chapter | IST-REx-ID: 2923
Analyzing Convex Relaxations for MAP Estimation
M.P. Kumar, V. Kolmogorov, P. Torr, in:, A. Blake, P. Kohli, C. Rother (Eds.), Markov Random Fields for Vision and Image Processing, Massachusetts Institute of Technology Press, 2011.
View
 
[42]
2011 | Book Chapter | IST-REx-ID: 2935
Basic graph cut algorithms
Y. Boykov, V. Kolmogorov, in:, A. Blake, P. Kohli, C. Rother (Eds.), Markov Random Fields for Vision and Image Processing, Massachusetts Institute of Technology Press, 2011, pp. 31–50.
View
 
[41]
2011 | Conference Paper | IST-REx-ID: 3205
Dynamic tree block coordinate ascent
D. Tarlow, D. Batra, P. Kohli, V. Kolmogorov, in:, Omnipress, 2011, pp. 113–120.
View | Download (ext.)
 
[40]
2010 | Conference Paper | IST-REx-ID: 3201
Cosegmentation revisited: Models and optimization
S. Vicente, V. Kolmogorov, C. Rother, in:, Springer, 2010, pp. 465–479.
View | DOI | Download (ext.)
 
[39]
2010 | Journal Article | IST-REx-ID: 3202 View | DOI
 
[38]
2010 | Conference Paper | IST-REx-ID: 2934
Generalized roof duality and bisubmodular functions
V. Kolmogorov, in:, Neural Information Processing Systems, 2010.
View | Files available
 
[37]
2009 | Journal Article | IST-REx-ID: 2932
Blossom V: A new implementation of a minimum cost perfect matching algorithm
V. Kolmogorov, Mathematical Programming Computation 1 (2009) 43–67.
View | DOI
 
[36]
2009 | Conference Paper | IST-REx-ID: 3199
Joint optimization of segmentation and appearance models
S. Vicente, V. Kolmogorov, C. Rother, in:, IEEE, 2009, pp. 755–762.
View | DOI | Download (ext.)
 
[35]
2009 | Conference Paper | IST-REx-ID: 3203
A global perspective on MAP inference for low level vision
O. Woodford, C. Rother, V. Kolmogorov, in:, IEEE, 2009, pp. 2319–2326.
View | DOI
 
[34]
2009 | Journal Article | IST-REx-ID: 3197   OA
An analysis of convex relaxations for MAP estimation of discrete MRFs
M.P. Kumar, V. Kolmogorov, P. Torr, Journal of Machine Learning Research 10 (2009) 71–106.
View | Download (ext.)
 
[33]
2009 | Journal Article | IST-REx-ID: 3200
New algorithms for convex cost tension problem with application to computer vision
V. Kolmogorov, A. Shioura, Discrete Optimization 6 (2009) 378–393.
View | DOI
 
[32]
2008 | Conference Paper | IST-REx-ID: 3198
Feature correspondence via graph matching: Models and global optimization
L. Torresani, V. Kolmogorov, C. Rother, in:, Springer, 2008, pp. 596–609.
View | DOI | Download (ext.)
 
[31]
2008 | Conference Paper | IST-REx-ID: 3194
On partial optimality in multi label MRFs
P. Kohli, A. Shekhovtsov, C. Rother, V. Kolmogorov, P. Torr, in:, Omnipress, 2008, pp. 480–487.
View | DOI | Download (ext.)
 
[30]
2008 | Conference Paper | IST-REx-ID: 3195
Graph cut based image segmentation with connectivity priors
S. Vicente, V. Kolmogorov, C. Rother, in:, IEEE, 2008.
View | DOI | Download (ext.)
 
[29]
2008 | Journal Article | IST-REx-ID: 3196
A comparative study of energy minimization methods for Markov random fields with smoothness-based priors
R. Szeliski, R. Zabih, D. Scharstein, O. Veksler, V. Kolmogorov, A. Agarwala, M. Tappen, C. Rother, IEEE Transactions on Pattern Analysis and Machine Intelligence 30 (2008) 1068–1080.
View | DOI
 
[28]
2007 | Journal Article | IST-REx-ID: 3193
Minimizing nonsubmodular functions with graph cuts - A review
V. Kolmogorov, C. Rother, IEEE Transactions on Pattern Analysis and Machine Intelligence 29 (2007) 1274–1279.
View | DOI
 
[27]
2007 | Journal Article | IST-REx-ID: 3187
Fusion of stereo colour and contrast
A. Blake, A. Criminisi, G. Cross, V. Kolmogorov, C. Rother, Springer Tracts in Advanced Robotics 28 (2007) 295–304.
View | DOI | Download (ext.)
 
[26]
2007 | Conference Paper | IST-REx-ID: 2933
An Analysis of Convex Relaxations for MAP Estimation
M.P. Kumar, V. Kolmogorov, P. Torr, in:, Neural Information Processing Systems, 2007.
View
 
[25]
2007 | Conference Paper | IST-REx-ID: 3191
Applications of parametric maxflow in computer vision
V. Kolmogorov, Y. Boykov, C. Rother, in:, IEEE, 2007.
View | DOI | Download (ext.)
 
[24]
2007 | Conference Paper | IST-REx-ID: 3192
Optimizing binary MRFs via extended roof duality
C. Rother, V. Kolmogorov, V. Lempitsky, M. Szummer, in:, IEEE, 2007.
View | DOI | Download (ext.)
 
[23]
2006 | Conference Paper | IST-REx-ID: 3186
An integral solution to surface evolution PDEs via geo cuts
Y. Boykov, V. Kolmogorov, D. Cremers, A. Delong, in:, Springer, 2006, pp. 409–422.
View | DOI
 
[22]
2006 | Book Chapter | IST-REx-ID: 2921
Graph cut algorithms for binocular stereo with occlusions
V. Kolmogorov, R. Zabih, in:, Handbook of Mathematical Models in Computer Vision, Springer, 2006, pp. 423–427.
View | DOI
 
[21]
2006 | Conference Paper | IST-REx-ID: 3188
Cosegmentation of image pairs by histogram matching - Incorporating a global constraint into MRFs
C. Rother, V. Kolmogorov, T. Minka, A. Blake, in:, IEEE, 2006, pp. 993–1000.
View | DOI
 
[20]
2006 | Journal Article | IST-REx-ID: 3190
Convergent tree reweighted message passing for energy minimization
V. Kolmogorov, IEEE Transactions on Pattern Analysis and Machine Intelligence 28 (2006) 1568–1583.
View | DOI | Download (ext.)
 
[19]
2006 | Conference Paper | IST-REx-ID: 3184
Comparison of energy minimization algorithms for highly connected graphs
V. Kolmogorov, C. Rother, in:, Springer, 2006, pp. 1–15.
View | DOI | Download (ext.)
 
[18]
2006 | Conference Paper | IST-REx-ID: 3189
Bilayer segmentation of live video
A. Criminisi, G. Cross, A. Blake, V. Kolmogorov, in:, IEEE, 2006, pp. 53–60.
View | DOI | Download (ext.)
 
[17]
2006 | Conference Paper | IST-REx-ID: 3180
A comparative study of energy minimization methods for Markov random fields
R. Szeliski, R. Zabih, D. Scharstein, O. Veksler, V. Kolmogorov, A. Agarwala, M. Tappen, C. Rother, in:, Springer, 2006, pp. 16–29.
View | DOI | Download (ext.)
 
[16]
2006 | Journal Article | IST-REx-ID: 3185
Probabilistic fusion of stereo with color and contrast for bilayer segmentation
V. Kolmogorov, A. Criminisi, A. Blake, G. Cross, C. Rother, IEEE Transactions on Pattern Analysis and Machine Intelligence 28 (2006) 1480–1492.
View | DOI | Download (ext.)
 
[15]
2005 | Conference Paper | IST-REx-ID: 3181
On the optimality of tree reweighted max product message passing
V. Kolmogorov, M. Wainwright, in:, AUAI Press, 2005, pp. 316–323.
View | Download (ext.)
 
[14]
2005 | Conference Paper | IST-REx-ID: 3175
Digital tapestry
C. Rother, S. Kumar, V. Kolmogorov, A. Blake, in:, IEEE, 2005, pp. 589–596.
View | DOI | Download (ext.)
 
[13]
2005 | Conference Paper | IST-REx-ID: 3182 View | DOI
 
[12]
2005 | Conference Paper | IST-REx-ID: 3176
Bi-layer segmentation of binocular stereo video
V. Kolmogorov, A. Criminisi, A. Blake, G. Cross, C. Rother, in:, IEEE, 2005, pp. 1186–1186.
View | DOI
 
[11]
2005 | Conference Paper | IST-REx-ID: 3183
Bi-layer segmentation of binocular stereo video
V. Kolmogorov, A. Criminisi, A. Blake, G. Cross, C. Rother, in:, IEEE, 2005, pp. 407–414.
View | DOI | Download (ext.)
 
[10]
2004 | Conference Paper | IST-REx-ID: 3179
"GrabCut" - Interactive foreground extraction using iterated graph cuts
C. Rother, V. Kolmogorov, A. Blake, in:, ACM, 2004, pp. 309–314.
View | DOI | Download (ext.)
 
[9]
2004 | Journal Article | IST-REx-ID: 3172
Multiprocessor scheduling implementation of the simultaneous multiple volume SMV navigator method
V. Kolmogorov, T. Nguyen, A. Nuval, P. Spincemaille, M. Prince, R. Zabih, Y. Wang, Magnetic Resonance in Medicine 52 (2004) 362–367.
View | DOI
 
[8]
2004 | Conference Paper | IST-REx-ID: 3177
Spatially coherent clustering using graph cuts
R. Zabih, V. Kolmogorov, in:, IEEE, 2004, pp. 437–444.
View | DOI
 
[7]
2004 | Journal Article | IST-REx-ID: 3173
What energy functions can be minimized via graph cuts?
V. Kolmogorov, R. Zabih, IEEE Transactions on Pattern Analysis and Machine Intelligence 26 (2004) 147–159.
View | DOI
 
[6]
2004 | Journal Article | IST-REx-ID: 3178
An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision
Y. Boykov, V. Kolmogorov, IEEE Transactions on Pattern Analysis and Machine Intelligence 26 (2004) 1124–1137.
View | DOI
 
[5]
2003 | Conference Paper | IST-REx-ID: 3174
Visual correspondence using energy minimization and mutual information
J. Kim, V. Kolmogorov, R. Zabih, in:, IEEE, 2003, pp. 1033–1040.
View | DOI
 
[4]
2003 | Conference Paper | IST-REx-ID: 3170
Computing geodesics and minimal surfaces via graph cuts
Y. Boykov, V. Kolmogorov, in:, IEEE, 2003, pp. 26–33.
View | DOI
 
[3]
2003 | Conference Paper | IST-REx-ID: 3171
Generalized multi camera scene reconstruction using graph cuts
V. Kolmogorov, R. Zabih, S. Gortler, in:, Springer, 2003, pp. 501–516.
View | DOI
 
[2]
2002 | Conference Paper | IST-REx-ID: 2927
Multi-camera scene reconstruction via graph cuts
V. Kolmogorov, R. Zabih, in:, Springer, 2002, pp. 65–81.
View | DOI
 
[1]
2001 | Conference Paper | IST-REx-ID: 3169
Computing visual correspondence with occlusions using graph cuts
V. Kolmogorov, R. Zabih, in:, IEEE, 2001, pp. 508–515.
View | DOI | Download (ext.)
 

Search

Filter Publications

Display / Sort

Export / Embed

85 Publications

Mark all

[85]
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
 
[84]
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
 
[83]
2018 | Journal Article | IST-REx-ID: 18   OA
Superconcentrators of density 25.3
V. Kolmogorov, M. Rolinek, Ars Combinatoria 141 (2018) 269–304.
View | Download (ext.) | arXiv
 
[82]
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
 
[81]
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
 
[80]
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.)
 
[79]
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.)
 
[78]
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.)
 
[77]
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.)
 
[76]
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
 
[75]
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.)
 
[74]
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.)
 
[73]
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.)
 
[72]
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.)
 
[71]
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.)
 
[70]
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
 
[69]
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.)
 
[68]
2015 | Journal Article | IST-REx-ID: 2271
The power of linear programming for general-valued CSPs
V. Kolmogorov, J. Thapper, S. Živný, SIAM Journal on Computing 44 (2015) 1–36.
View | Files available | DOI | Download (ext.) | arXiv
 
[67]
2014 | Conference Paper | IST-REx-ID: 2275   OA
Partial enumeration and curvature regularization
C. Olsson, J. Ulen, Y. Boykov, V. Kolmogorov, in:, IEEE, 2014, pp. 2936–2943.
View | Files available | DOI
 
[66]
2013 | Conference Paper | IST-REx-ID: 2272   OA
Inference algorithms for pattern-based CRFs on sequence data
R. Takhanov, V. Kolmogorov, in:, ICML’13 Proceedings of the 30th International Conference on International, International Machine Learning Society, 2013, pp. 145–153.
View | Files available | Download (ext.)
 
[65]
2013 | Conference Paper | IST-REx-ID: 2518   OA View | Files available | DOI | Download (ext.) | arXiv
 
[64]
2013 | Journal Article | IST-REx-ID: 2828   OA
The complexity of conservative valued CSPs
V. Kolmogorov, S. Živný, Journal of the ACM 60 (2013).
View | DOI | Download (ext.) | arXiv
 
[63]
2013 | Report | IST-REx-ID: 2273   OA
Reweighted message passing revisited
V. Kolmogorov, Reweighted Message Passing Revisited, IST Austria, 2013.
View | Download (ext.)
 
[62]
2013 | Conference Paper | IST-REx-ID: 2901   OA
Computing the M most probable modes of a graphical model
C. Chen, V. Kolmogorov, Z. Yan, D. Metaxas, C. Lampert, in:, JMLR, 2013, pp. 161–169.
View | Download (ext.)
 
[61]
2013 | Report | IST-REx-ID: 2274   OA
Proofs of Space
S. Dziembowski, S. Faust, V. Kolmogorov, K.Z. Pietrzak, Proofs of Space, IST Austria, 2013.
View | Files available
 
[60]
2013 | Conference Paper | IST-REx-ID: 2270   OA
Optimal Coalition Structures in Cooperative Graph Games
Y. Bachrach, P. Kohli, V. Kolmogorov, M. Zadimoghaddam, in:, AAAI Press, 2013, pp. 81–87.
View | Download (ext.) | arXiv
 
[59]
2013 | Conference Paper | IST-REx-ID: 2276   OA
Potts model, parametric maxflow and k-submodular functions
I. Gridchyn, V. Kolmogorov, in:, IEEE, 2013, pp. 2320–2327.
View | DOI | Download (ext.) | arXiv
 
[58]
2012 | Report | IST-REx-ID: 2929   OA
The power of linear programming for valued CSPs: a constructive characterization
V. Kolmogorov, The Power of Linear Programming for Valued CSPs: A Constructive Characterization, Unknown, 2012.
View | Download (ext.)
 
[57]
2012 | Journal Article | IST-REx-ID: 2931
A dual decomposition approach to feature correspondence
L. Torresani, V. Kolmogorov, C. Rother, IEEE Transactions on Pattern Analysis and Machine Intelligence 35 (2012) 259–271.
View | DOI
 
[56]
2012 | Journal Article | IST-REx-ID: 3117   OA
Minimizing a sum of submodular functions
V. Kolmogorov, Discrete Applied Mathematics 160 (2012) 2246–2258.
View | DOI | Download (ext.)
 
[55]
2012 | Conference Paper | IST-REx-ID: 3124
Approximating marginals using discrete energy minimization
F. Korc, V. Kolmogorov, C. Lampert, in:, ICML, 2012.
View | Files available
 
[54]
2012 | Technical Report | IST-REx-ID: 5396   OA
Approximating marginals using discrete energy minimization
F. Korc, V. Kolmogorov, C. Lampert, Approximating Marginals Using Discrete Energy Minimization, IST Austria, 2012.
View | Files available | DOI
 
[53]
2012 | Journal Article | IST-REx-ID: 3257   OA
Generalized roof duality and bisubmodular functions
V. Kolmogorov, Discrete Applied Mathematics 160 (2012) 416–426.
View | Files available | DOI | Download (ext.) | arXiv
 
[52]
2012 | Conference Paper | IST-REx-ID: 3284   OA
The complexity of conservative valued CSPs
V. Kolmogorov, S. Živný, in:, SIAM, 2012, pp. 750–759.
View | Download (ext.)
 
[51]
2012 | Conference Paper | IST-REx-ID: 2930   OA
Towards minimizing k-submodular functions
A. Huber, V. Kolmogorov, in:, Springer, 2012, pp. 451–462.
View | DOI | Download (ext.)
 
[50]
2012 | Preprint | IST-REx-ID: 2928   OA
Generalized sequential tree-reweighted message passing
V. Kolmogorov, T. Schoenemann, ArXiv (2012).
View | Download (ext.) | arXiv
 
[49]
2011 | Book Chapter | IST-REx-ID: 2924
Bilayer Segmentation of Video
A. Criminisi, G. Cross, A. Blake, V. Kolmogorov, in:, A. Blake, P. Kohli, C. Rother (Eds.), Markov Random Fields for Vision and Image Processing, Massachusetts Institute of Technology Press, 2011.
View
 
[48]
2011 | Conference Paper | IST-REx-ID: 3206
Submodular decomposition framework for inference in associative Markov networks with global constraints
A. Osokin, D. Vetrov, V. Kolmogorov, in:, IEEE, 2011, pp. 1889–1896.
View | DOI | Download (ext.)
 
[47]
2011 | Book Chapter | IST-REx-ID: 2925
Interactive Foreground Extraction using graph cut
C. Rother, V. Kolmogorov, Y. Boykov, A. Blake, in:, A. Blake, P. Kohli, C. Rother (Eds.), Markov Random Fields for Vision and Image Processing, Massachusetts Institute of Technology Press, 2011.
View
 
[46]
2011 | Conference Paper | IST-REx-ID: 3207
Object cosegmentation
S. Vicente, C. Rother, V. Kolmogorov, in:, IEEE, 2011, pp. 2217–2224.
View | DOI
 
[45]
2011 | Book Chapter | IST-REx-ID: 2922
Graph-cut Based Image Segmentation with Connectivity Priors
S. Vicente, V. Kolmogorov, C. Rother, in:, A. Blake, P. Kohli, C. Rother (Eds.), Markov Random Fields for Vision and Image Processing, Massachusetts Institute of Technology Press, 2011.
View
 
[44]
 
[43]
2011 | Book Chapter | IST-REx-ID: 2923
Analyzing Convex Relaxations for MAP Estimation
M.P. Kumar, V. Kolmogorov, P. Torr, in:, A. Blake, P. Kohli, C. Rother (Eds.), Markov Random Fields for Vision and Image Processing, Massachusetts Institute of Technology Press, 2011.
View
 
[42]
2011 | Book Chapter | IST-REx-ID: 2935
Basic graph cut algorithms
Y. Boykov, V. Kolmogorov, in:, A. Blake, P. Kohli, C. Rother (Eds.), Markov Random Fields for Vision and Image Processing, Massachusetts Institute of Technology Press, 2011, pp. 31–50.
View
 
[41]
2011 | Conference Paper | IST-REx-ID: 3205
Dynamic tree block coordinate ascent
D. Tarlow, D. Batra, P. Kohli, V. Kolmogorov, in:, Omnipress, 2011, pp. 113–120.
View | Download (ext.)
 
[40]
2010 | Conference Paper | IST-REx-ID: 3201
Cosegmentation revisited: Models and optimization
S. Vicente, V. Kolmogorov, C. Rother, in:, Springer, 2010, pp. 465–479.
View | DOI | Download (ext.)
 
[39]
2010 | Journal Article | IST-REx-ID: 3202 View | DOI
 
[38]
2010 | Conference Paper | IST-REx-ID: 2934
Generalized roof duality and bisubmodular functions
V. Kolmogorov, in:, Neural Information Processing Systems, 2010.
View | Files available
 
[37]
2009 | Journal Article | IST-REx-ID: 2932
Blossom V: A new implementation of a minimum cost perfect matching algorithm
V. Kolmogorov, Mathematical Programming Computation 1 (2009) 43–67.
View | DOI
 
[36]
2009 | Conference Paper | IST-REx-ID: 3199
Joint optimization of segmentation and appearance models
S. Vicente, V. Kolmogorov, C. Rother, in:, IEEE, 2009, pp. 755–762.
View | DOI | Download (ext.)
 
[35]
2009 | Conference Paper | IST-REx-ID: 3203
A global perspective on MAP inference for low level vision
O. Woodford, C. Rother, V. Kolmogorov, in:, IEEE, 2009, pp. 2319–2326.
View | DOI
 
[34]
2009 | Journal Article | IST-REx-ID: 3197   OA
An analysis of convex relaxations for MAP estimation of discrete MRFs
M.P. Kumar, V. Kolmogorov, P. Torr, Journal of Machine Learning Research 10 (2009) 71–106.
View | Download (ext.)
 
[33]
2009 | Journal Article | IST-REx-ID: 3200
New algorithms for convex cost tension problem with application to computer vision
V. Kolmogorov, A. Shioura, Discrete Optimization 6 (2009) 378–393.
View | DOI
 
[32]
2008 | Conference Paper | IST-REx-ID: 3198
Feature correspondence via graph matching: Models and global optimization
L. Torresani, V. Kolmogorov, C. Rother, in:, Springer, 2008, pp. 596–609.
View | DOI | Download (ext.)
 
[31]
2008 | Conference Paper | IST-REx-ID: 3194
On partial optimality in multi label MRFs
P. Kohli, A. Shekhovtsov, C. Rother, V. Kolmogorov, P. Torr, in:, Omnipress, 2008, pp. 480–487.
View | DOI | Download (ext.)
 
[30]
2008 | Conference Paper | IST-REx-ID: 3195
Graph cut based image segmentation with connectivity priors
S. Vicente, V. Kolmogorov, C. Rother, in:, IEEE, 2008.
View | DOI | Download (ext.)
 
[29]
2008 | Journal Article | IST-REx-ID: 3196
A comparative study of energy minimization methods for Markov random fields with smoothness-based priors
R. Szeliski, R. Zabih, D. Scharstein, O. Veksler, V. Kolmogorov, A. Agarwala, M. Tappen, C. Rother, IEEE Transactions on Pattern Analysis and Machine Intelligence 30 (2008) 1068–1080.
View | DOI
 
[28]
2007 | Journal Article | IST-REx-ID: 3193
Minimizing nonsubmodular functions with graph cuts - A review
V. Kolmogorov, C. Rother, IEEE Transactions on Pattern Analysis and Machine Intelligence 29 (2007) 1274–1279.
View | DOI
 
[27]
2007 | Journal Article | IST-REx-ID: 3187
Fusion of stereo colour and contrast
A. Blake, A. Criminisi, G. Cross, V. Kolmogorov, C. Rother, Springer Tracts in Advanced Robotics 28 (2007) 295–304.
View | DOI | Download (ext.)
 
[26]
2007 | Conference Paper | IST-REx-ID: 2933
An Analysis of Convex Relaxations for MAP Estimation
M.P. Kumar, V. Kolmogorov, P. Torr, in:, Neural Information Processing Systems, 2007.
View
 
[25]
2007 | Conference Paper | IST-REx-ID: 3191
Applications of parametric maxflow in computer vision
V. Kolmogorov, Y. Boykov, C. Rother, in:, IEEE, 2007.
View | DOI | Download (ext.)
 
[24]
2007 | Conference Paper | IST-REx-ID: 3192
Optimizing binary MRFs via extended roof duality
C. Rother, V. Kolmogorov, V. Lempitsky, M. Szummer, in:, IEEE, 2007.
View | DOI | Download (ext.)
 
[23]
2006 | Conference Paper | IST-REx-ID: 3186
An integral solution to surface evolution PDEs via geo cuts
Y. Boykov, V. Kolmogorov, D. Cremers, A. Delong, in:, Springer, 2006, pp. 409–422.
View | DOI
 
[22]
2006 | Book Chapter | IST-REx-ID: 2921
Graph cut algorithms for binocular stereo with occlusions
V. Kolmogorov, R. Zabih, in:, Handbook of Mathematical Models in Computer Vision, Springer, 2006, pp. 423–427.
View | DOI
 
[21]
2006 | Conference Paper | IST-REx-ID: 3188
Cosegmentation of image pairs by histogram matching - Incorporating a global constraint into MRFs
C. Rother, V. Kolmogorov, T. Minka, A. Blake, in:, IEEE, 2006, pp. 993–1000.
View | DOI
 
[20]
2006 | Journal Article | IST-REx-ID: 3190
Convergent tree reweighted message passing for energy minimization
V. Kolmogorov, IEEE Transactions on Pattern Analysis and Machine Intelligence 28 (2006) 1568–1583.
View | DOI | Download (ext.)
 
[19]
2006 | Conference Paper | IST-REx-ID: 3184
Comparison of energy minimization algorithms for highly connected graphs
V. Kolmogorov, C. Rother, in:, Springer, 2006, pp. 1–15.
View | DOI | Download (ext.)
 
[18]
2006 | Conference Paper | IST-REx-ID: 3189
Bilayer segmentation of live video
A. Criminisi, G. Cross, A. Blake, V. Kolmogorov, in:, IEEE, 2006, pp. 53–60.
View | DOI | Download (ext.)
 
[17]
2006 | Conference Paper | IST-REx-ID: 3180
A comparative study of energy minimization methods for Markov random fields
R. Szeliski, R. Zabih, D. Scharstein, O. Veksler, V. Kolmogorov, A. Agarwala, M. Tappen, C. Rother, in:, Springer, 2006, pp. 16–29.
View | DOI | Download (ext.)
 
[16]
2006 | Journal Article | IST-REx-ID: 3185
Probabilistic fusion of stereo with color and contrast for bilayer segmentation
V. Kolmogorov, A. Criminisi, A. Blake, G. Cross, C. Rother, IEEE Transactions on Pattern Analysis and Machine Intelligence 28 (2006) 1480–1492.
View | DOI | Download (ext.)
 
[15]
2005 | Conference Paper | IST-REx-ID: 3181
On the optimality of tree reweighted max product message passing
V. Kolmogorov, M. Wainwright, in:, AUAI Press, 2005, pp. 316–323.
View | Download (ext.)
 
[14]
2005 | Conference Paper | IST-REx-ID: 3175
Digital tapestry
C. Rother, S. Kumar, V. Kolmogorov, A. Blake, in:, IEEE, 2005, pp. 589–596.
View | DOI | Download (ext.)
 
[13]
2005 | Conference Paper | IST-REx-ID: 3182 View | DOI
 
[12]
2005 | Conference Paper | IST-REx-ID: 3176
Bi-layer segmentation of binocular stereo video
V. Kolmogorov, A. Criminisi, A. Blake, G. Cross, C. Rother, in:, IEEE, 2005, pp. 1186–1186.
View | DOI
 
[11]
2005 | Conference Paper | IST-REx-ID: 3183
Bi-layer segmentation of binocular stereo video
V. Kolmogorov, A. Criminisi, A. Blake, G. Cross, C. Rother, in:, IEEE, 2005, pp. 407–414.
View | DOI | Download (ext.)
 
[10]
2004 | Conference Paper | IST-REx-ID: 3179
"GrabCut" - Interactive foreground extraction using iterated graph cuts
C. Rother, V. Kolmogorov, A. Blake, in:, ACM, 2004, pp. 309–314.
View | DOI | Download (ext.)
 
[9]
2004 | Journal Article | IST-REx-ID: 3172
Multiprocessor scheduling implementation of the simultaneous multiple volume SMV navigator method
V. Kolmogorov, T. Nguyen, A. Nuval, P. Spincemaille, M. Prince, R. Zabih, Y. Wang, Magnetic Resonance in Medicine 52 (2004) 362–367.
View | DOI
 
[8]
2004 | Conference Paper | IST-REx-ID: 3177
Spatially coherent clustering using graph cuts
R. Zabih, V. Kolmogorov, in:, IEEE, 2004, pp. 437–444.
View | DOI
 
[7]
2004 | Journal Article | IST-REx-ID: 3173
What energy functions can be minimized via graph cuts?
V. Kolmogorov, R. Zabih, IEEE Transactions on Pattern Analysis and Machine Intelligence 26 (2004) 147–159.
View | DOI
 
[6]
2004 | Journal Article | IST-REx-ID: 3178
An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision
Y. Boykov, V. Kolmogorov, IEEE Transactions on Pattern Analysis and Machine Intelligence 26 (2004) 1124–1137.
View | DOI
 
[5]
2003 | Conference Paper | IST-REx-ID: 3174
Visual correspondence using energy minimization and mutual information
J. Kim, V. Kolmogorov, R. Zabih, in:, IEEE, 2003, pp. 1033–1040.
View | DOI
 
[4]
2003 | Conference Paper | IST-REx-ID: 3170
Computing geodesics and minimal surfaces via graph cuts
Y. Boykov, V. Kolmogorov, in:, IEEE, 2003, pp. 26–33.
View | DOI
 
[3]
2003 | Conference Paper | IST-REx-ID: 3171
Generalized multi camera scene reconstruction using graph cuts
V. Kolmogorov, R. Zabih, S. Gortler, in:, Springer, 2003, pp. 501–516.
View | DOI
 
[2]
2002 | Conference Paper | IST-REx-ID: 2927
Multi-camera scene reconstruction via graph cuts
V. Kolmogorov, R. Zabih, in:, Springer, 2002, pp. 65–81.
View | DOI
 
[1]
2001 | Conference Paper | IST-REx-ID: 3169
Computing visual correspondence with occlusions using graph cuts
V. Kolmogorov, R. Zabih, in:, IEEE, 2001, pp. 508–515.
View | DOI | Download (ext.)
 

Search

Filter Publications

Display / Sort

Export / Embed