Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVladimir Kolmogorov
Person information
- affiliation: Institute of Sciente and Technology, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j27]Rustem Takhanov, Vladimir Kolmogorov:
Combining pattern-based CRFs and weighted context-free grammars. Intell. Data Anal. 26(1): 257-272 (2022)- [i39]Vladimir Kolmogorov:
A computational study of Gomory-Hu tree algorithms. CoRR abs/2204.10169 (2022) - [i38]Vladimir Kolmogorov:
OrderedCuts: A new approach for computing Gomory-Hu tree. CoRR abs/2208.02000 (2022) - 2021
- [c57]David G. Harris, Fotis Iliopoulos, Vladimir Kolmogorov:
A New Notion of Commutativity for the Algorithmic Lovász Local Lemma. APPROX-RANDOM 2021: 31:1-31:25 - [c56]Vladimir Kolmogorov, Thomas Pock:
One-sided Frank-Wolfe algorithms for saddle problems. ICML 2021: 5665-5675 - [i37]Martin Dvorak, Vladimir Kolmogorov:
Generalized minimum 0-extension problem and discrete convexity. CoRR abs/2109.10203 (2021) - 2020
- [i36]David G. Harris, Vladimir Kolmogorov:
Parameter estimation for Gibbs distributions. CoRR abs/2007.10824 (2020) - [i35]David G. Harris, Fotis Iliopoulos, Vladimir Kolmogorov:
A new notion of commutativity for the algorithmic Lovász Local Lemma. CoRR abs/2008.05569 (2020) - [i34]Vladimir Kolmogorov:
Practical Frank-Wolfe algorithms. CoRR abs/2010.09567 (2020)
2010 – 2019
- 2019
- [j26]Dimitris Achlioptas, Fotis Iliopoulos, Vladimir Kolmogorov:
A Local Lemma for Focused Stochastic Algorithms. SIAM J. Comput. 48(5): 1583-1602 (2019) - [j25]Alexandr Kazda
, Vladimir Kolmogorov, Michal Rolínek:
Even Delta-Matroids and the Complexity of Planar Boolean CSPs. ACM Trans. Algorithms 15(2): 22:1-22:33 (2019) - [c55]Paul Swoboda, Vladimir Kolmogorov:
MAP Inference via Block-Coordinate Frank-Wolfe Algorithm. CVPR 2019: 11146-11155 - [c54]Vladimir Kolmogorov:
Testing the Complexity of a Valued CSP Language. ICALP 2019: 77:1-77:12 - [c53]Amal Rannen-Triki, Maxim Berman, Vladimir Kolmogorov, Matthew B. Blaschko:
Function Norms for Neural Networks. ICCV Workshops 2019: 748-752 - 2018
- [j24]Vladimir Kolmogorov, Michal Rolínek:
Superconcentrators of Density 25.3. Ars Comb. 141: 269-304 (2018) - [j23]Vladimir Kolmogorov:
Commutativity in the Algorithmic Lovász Local Lemma. SIAM J. Comput. 47(6): 2029-2056 (2018) - [c52]Vladimir Kolmogorov:
A Faster Approximation Algorithm for the Gibbs Partition Function. COLT 2018: 228-249 - [c51]Pritish Mohapatra, Michal Rolínek, C. V. Jawahar, Vladimir Kolmogorov, M. Pawan Kumar:
Efficient Optimization for Rank-Based Loss Functions. CVPR 2018: 3693-3701 - [i33]Vladimir Kolmogorov:
Testing the complexity of a valued CSP language. CoRR abs/1803.02289 (2018) - [i32]Paul Swoboda, Vladimir Kolmogorov:
MAP inference via Block-Coordinate Frank-Wolfe Algorithm. CoRR abs/1806.05049 (2018) - [i31]Dimitris Achlioptas, Fotis Iliopoulos, Vladimir Kolmogorov:
A Local Lemma for Focused Stochastic Algorithms. CoRR abs/1809.01537 (2018) - 2017
- [j22]Vladimir Kolmogorov, Andrei A. Krokhin, Michal Rolínek:
The Complexity of General-Valued CSPs. SIAM J. Comput. 46(3): 1087-1110 (2017) - [c50]Alexandr Kazda, Vladimir Kolmogorov, Michal Rolínek:
Even Delta-Matroids and the Complexity of Planar Boolean CSPs. SODA 2017: 307-326 - 2016
- [j21]Vladimir Kolmogorov, Rustem Takhanov:
Inference Algorithms for Pattern-Based CRFs on Sequence Data. Algorithmica 76(1): 17-46 (2016) - [j20]Vladimir Kolmogorov, Thomas Pock, Michal Rolínek:
Total Variation on a Tree. SIAM J. Imaging Sci. 9(2): 605-636 (2016) - [c49]Joël Alwen, Binyi Chen, Chethan Kamath, Vladimir Kolmogorov, Krzysztof Pietrzak, Stefano Tessaro:
On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model. EUROCRYPT (2) 2016: 358-387 - [c48]Vladimir Kolmogorov:
Commutativity in the Algorithmic Lovász Local Lemma. FOCS 2016: 780-787 - [i30]Alexandr Kazda, Vladimir Kolmogorov, Michal Rolínek:
Even Delta-Matroids and the Complexity of Planar Boolean CSPs. CoRR abs/1602.03124 (2016) - [i29]Pritish Mohapatra, Michal Rolínek, C. V. Jawahar, Vladimir Kolmogorov, M. Pawan Kumar:
Efficient Optimization for Rank-based Loss Functions. CoRR abs/1604.08269 (2016) - [i28]Vladimir Kolmogorov:
A Faster Approximation Algorithm for the Gibbs Partition Function. CoRR abs/1608.04223 (2016) - [i27]Joël Alwen, Binyi Chen, Chethan Kamath, Vladimir Kolmogorov, Krzysztof Pietrzak, Stefano Tessaro:
On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model. IACR Cryptol. ePrint Arch. 2016: 100 (2016) - 2015
- [j19]Vladimir Kolmogorov:
A New Look at Reweighted Message Passing. IEEE Trans. Pattern Anal. Mach. Intell. 37(5): 919-930 (2015) - [j18]Vladimir Kolmogorov, Johan Thapper, Stanislav Zivný:
The Power of Linear Programming for General-Valued CSPs. SIAM J. Comput. 44(1): 1-36 (2015) - [c47]Stefan Dziembowski, Sebastian Faust, Vladimir Kolmogorov, Krzysztof Pietrzak:
Proofs of Space. CRYPTO (2) 2015: 585-605 - [c46]Neel Shah, Vladimir Kolmogorov, Christoph H. Lampert:
A multi-plane block-coordinate frank-wolfe algorithm for training structural SVMs with a costly max-oracle. CVPR 2015: 2737-2745 - [c45]Vladimir Kolmogorov, Andrei A. Krokhin, Michal Rolínek:
The Complexity of General-Valued CSPs. FOCS 2015: 1246-1258 - [c44]Vladimir Kolmogorov, Michal Rolínek, Rustem Takhanov:
Effectiveness of Structural Restrictions for Hybrid CSPs. ISAAC 2015: 566-577 - [i26]Vladimir Kolmogorov, Andrei A. Krokhin, Michal Rolínek:
The Complexity of General-Valued CSPs. CoRR abs/1502.07327 (2015) - [i25]Vladimir Kolmogorov, Thomas Pock, Michal Rolínek:
Total variation on a tree. CoRR abs/1502.07770 (2015) - [i24]Vladimir Kolmogorov, Michal Rolínek, Rustem Takhanov:
Effectiveness of Structural Restrictions for Hybrid CSPs. CoRR abs/1504.07067 (2015) - [i23]Vladimir Kolmogorov:
Commutativity in the Random Walk formulation of the Lovasz Local Lemma. CoRR abs/1506.08547 (2015) - 2014
- [j17]Vladimir Kolmogorov, Pascal Monasse, Pauline Tan:
Kolmogorov and Zabih's Graph Cuts Stereo Matching Algorithm. Image Process. Line 4: 220-251 (2014) - [p2]Vladimir Kolmogorov:
Tree-Reweighted Message Passing. Tractability 2014: 175-201 - [i22]Vladimir Kolmogorov, Christoph H. Lampert, Emilie Morvant, Rustem Takhanov:
Proceedings of The 38th Annual Workshop of the Austrian Association for Pattern Recognition (ÖAGM), 2014. CoRR abs/1404.3538 (2014) - [i21]Rustem Takhanov, Vladimir Kolmogorov:
Combining pattern-based CRFs and weighted context-free grammars. CoRR abs/1404.5475 (2014) - [i20]Vladimir Kolmogorov, Michal Rolínek:
Superconcentrators of Density 25.3. CoRR abs/1405.7828 (2014) - [i19]Neel Shah, Vladimir Kolmogorov, Christoph H. Lampert:
A Multi-Plane Block-Coordinate Frank-Wolfe Algorithm for Structural SVMs with a Costly max-Oracle. CoRR abs/1408.6804 (2014) - 2013
- [j16]Vladimir Kolmogorov, Stanislav Zivný:
The complexity of conservative valued CSPs. J. ACM 60(2): 10:1-10:38 (2013) - [j15]Lorenzo Torresani, Vladimir Kolmogorov, Carsten Rother:
A Dual Decomposition Approach to Feature Correspondence. IEEE Trans. Pattern Anal. Mach. Intell. 35(2): 259-271 (2013) - [c43]Yoram Bachrach, Pushmeet Kohli, Vladimir Kolmogorov, Morteza Zadimoghaddam:
Optimal Coalition Structure Generation in Cooperative Graph Games. AAAI 2013 - [c42]Chao Chen, Vladimir Kolmogorov, Yan Zhu, Dimitris N. Metaxas, Christoph H. Lampert:
Computing the M Most Probable Modes of a Graphical Model. AISTATS 2013: 161-169 - [c41]Vladimir Kolmogorov:
The Power of Linear Programming for Finite-Valued CSPs: A Constructive Characterization. ICALP (1) 2013: 625-636 - [c40]Igor Gridchyn, Vladimir Kolmogorov:
Potts Model, Parametric Maxflow and K-Submodular Functions. ICCV 2013: 2320-2327 - [c39]Carl Olsson, Johannes Ulén, Yuri Boykov, Vladimir Kolmogorov:
Partial Enumeration and Curvature Regularization. ICCV 2013: 2936-2943 - [c38]Rustem Takhanov, Vladimir Kolmogorov:
Inference algorithms for pattern-based CRFs on sequence data. ICML (3) 2013: 145-153 - [i18]Anna Huber, Vladimir Kolmogorov:
Towards Minimizing k-Submodular Functions. CoRR abs/1309.5469 (2013) - [i17]Vladimir Kolmogorov:
Reweighted message passing revisited. CoRR abs/1309.5655 (2013) - [i16]Igor Gridchyn, Vladimir Kolmogorov:
Potts model, parametric maxflow and k-submodular functions. CoRR abs/1310.1771 (2013) - [i15]Vladimir Kolmogorov, Johan Thapper, Stanislav Zivný:
The power of linear programming for general-valued CSPs. CoRR abs/1311.4219 (2013) - [i14]Stefan Dziembowski, Sebastian Faust, Vladimir Kolmogorov, Krzysztof Pietrzak:
Proofs of Space. IACR Cryptol. ePrint Arch. 2013: 796 (2013) - 2012
- [j14]Vladimir Kolmogorov:
Generalized roof duality and bisubmodular functions. Discret. Appl. Math. 160(4-5): 416-426 (2012) - [j13]Vladimir Kolmogorov:
Minimizing a sum of submodular functions. Discret. Appl. Math. 160(15): 2246-2258 (2012) - [c37]Anna Huber, Vladimir Kolmogorov:
Towards Minimizing k-Submodular Functions. ISCO 2012: 451-462 - [c36]Vladimir Kolmogorov, Stanislav Zivný:
The complexity of conservative valued CSPs. SODA 2012: 750-759 - [i13]Vladimir Kolmogorov, Thomas Schoenemann:
Generalized sequential tree-reweighted message passing. CoRR abs/1205.6352 (2012) - [i12]Vladimir Kolmogorov, Martin J. Wainwright:
On the optimality of tree-reweighted max-product message-passing. CoRR abs/1207.1395 (2012) - [i11]Vladimir Kolmogorov:
The power of linear programming for valued CSPs: a constructive characterization. CoRR abs/1207.7213 (2012) - [i10]Rustem Takhanov, Vladimir Kolmogorov:
Inference algorithms for pattern-based CRFs on sequence data. CoRR abs/1210.0508 (2012) - 2011
- [c35]Yoram Bachrach, Pushmeet Kohli, Vladimir Kolmogorov:
Team coverage games. AAMAS 2011: 1197-1198 - [c34]Anton Osokin, Dmitry P. Vetrov, Vladimir Kolmogorov:
Submodular decomposition framework for inference in associative Markov networks with global constraints. CVPR 2011: 1889-1896 - [c33]Sara Vicente, Carsten Rother, Vladimir Kolmogorov:
Object cosegmentation. CVPR 2011: 2217-2224 - [c32]Daniel Tarlow, Dhruv Batra, Pushmeet Kohli, Vladimir Kolmogorov:
Dynamic Tree Block Coordinate Ascent. ICML 2011: 113-120 - [c31]Vladimir Kolmogorov:
Submodularity on a Tree: Unifying $L^\natural$ -Convex and Bisubmodular Functions. MFCS 2011: 400-411 - [i9]Anton Osokin, Dmitry P. Vetrov, Vladimir Kolmogorov:
Submodular Decomposition Framework for Inference in Associative Markov Networks with Global Constraints. CoRR abs/1103.1077 (2011) - [i8]Yoram Bachrach, Pushmeet Kohli, Vladimir Kolmogorov, Morteza Zadimoghaddam:
Optimal Coalition Structures in Graph Games. CoRR abs/1108.5248 (2011) - [i7]Vladimir Kolmogorov, Stanislav Zivný:
The complexity of conservative valued CSPs. CoRR abs/1110.2809 (2011) - 2010
- [j12]Vladimir Kolmogorov:
A Faster Algorithm for Computing the Principal Sequence of Partitions of a Graph. Algorithmica 56(4): 394-412 (2010) - [c30]Sara Vicente, Vladimir Kolmogorov, Carsten Rother:
Cosegmentation Revisited: Models and Optimization. ECCV (2) 2010: 465-479 - [c29]Vladimir Kolmogorov:
Generalized roof duality and bisubmodular functions. NIPS 2010: 1144-1152 - [i6]Vladimir Kolmogorov:
Generalized roof duality and bisubmodular functions. CoRR abs/1005.2305 (2010) - [i5]Vladimir Kolmogorov:
Minimizing a sum of submodular functions. CoRR abs/1006.1990 (2010) - [i4]Vladimir Kolmogorov:
Submodularity on a tree: Unifying $L^\natural$-convex and bisubmodular functions. CoRR abs/1007.1229 (2010) - [i3]Vladimir Kolmogorov, Stanislav Zivný:
The complexity of conservative finite-valued CSPs. CoRR abs/1008.1555 (2010) - [i2]Vladimir Kolmogorov, Stanislav Zivný:
Generalising tractable VCSPs defined by symmetric tournament pair multimorphisms. CoRR abs/1008.3104 (2010) - [i1]Vladimir Kolmogorov:
A dichotomy theorem for conservative general-valued CSPs. CoRR abs/1008.4035 (2010)
2000 – 2009
- 2009
- [j11]Vladimir Kolmogorov, Akiyoshi Shioura:
New algorithms for convex cost tension problem with application to computer vision. Discret. Optim. 6(4): 378-393 (2009) - [j10]M. Pawan Kumar, Vladimir Kolmogorov, Philip H. S. Torr:
An Analysis of Convex Relaxations for MAP Estimation of Discrete MRFs. J. Mach. Learn. Res. 10: 71-106 (2009) - [j9]Vladimir Kolmogorov:
Blossom V: a new implementation of a minimum cost perfect matching algorithm. Math. Program. Comput. 1(1): 43-67 (2009) - [c28]Sara Vicente, Vladimir Kolmogorov, Carsten Rother:
Joint optimization of segmentation and appearance models. ICCV 2009: 755-762 - [c27]Oliver J. Woodford, Carsten Rother, Vladimir Kolmogorov:
A global perspective on MAP inference for low-level vision. ICCV 2009: 2319-2326 - 2008
- [j8]Vladimir Kolmogorov, Antonio Criminisi, Andrew Blake, Geoffrey Cross, Carsten Rother:
Probabilistic Fusion of Stereo with Color and Contrast for Bi-Layer Segmentation. Int. J. Comput. Vis. 76(2): 107 (2008) - [j7]Richard Szeliski, Ramin Zabih, Daniel Scharstein, Olga Veksler, Vladimir Kolmogorov, Aseem Agarwala, Marshall F. Tappen, Carsten Rother:
A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors. IEEE Trans. Pattern Anal. Mach. Intell. 30(6): 1068-1080 (2008) - [c26]Sara Vicente, Vladimir Kolmogorov, Carsten Rother:
Graph cut based image segmentation with connectivity priors. CVPR 2008 - [c25]Lorenzo Torresani, Vladimir Kolmogorov, Carsten Rother:
Feature Correspondence Via Graph Matching: Models and Global Optimization. ECCV (2) 2008: 596-609 - [c24]Pushmeet Kohli, Alexander Shekhovtsov, Carsten Rother, Vladimir Kolmogorov, Philip H. S. Torr:
On partial optimality in multi-label MRFs. ICML 2008: 480-487 - 2007
- [j6]Vladimir Kolmogorov, Carsten Rother:
Minimizing Nonsubmodular Functions with Graph Cuts-A Review. IEEE Trans. Pattern Anal. Mach. Intell. 29(7): 1274-1279 (2007) - [c23]Carsten Rother, Vladimir Kolmogorov, Victor S. Lempitsky, Martin Szummer:
Optimizing Binary MRFs via Extended Roof Duality. CVPR 2007 - [c22]Vladimir Kolmogorov, Yuri Boykov, Carsten Rother:
Applications of parametric maxflow in computer vision. ICCV 2007: 1-8 - [c21]Pawan Kumar Mudigonda, Vladimir Kolmogorov, Philip H. S. Torr:
An Analysis of Convex Relaxations for MAP Estimation. NIPS 2007: 1041-1048 - 2006
- [j5]Vladimir Kolmogorov, Antonio Criminisi, Andrew Blake, Geoffrey Cross, Carsten Rother:
Probabilistic Fusion of Stereo with Color and Contrast for Bilayer Segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 28(9): 1480-1492 (2006) - [j4]Vladimir Kolmogorov:
Convergent Tree-Reweighted Message Passing for Energy Minimization. IEEE Trans. Pattern Anal. Mach. Intell. 28(10): 1568-1583 (2006) - [c20]Antonio Criminisi, Geoffrey Cross, Andrew Blake, Vladimir Kolmogorov:
Bilayer Segmentation of Live Video. CVPR (1) 2006: 53-60 - [c19]Carsten Rother, Thomas P. Minka, Andrew Blake, Vladimir Kolmogorov:
Cosegmentation of Image Pairs by Histogram Matching - Incorporating a Global Constraint into MRFs. CVPR (1) 2006: 993-1000 - [c18]Vladimir Kolmogorov, Carsten Rother:
Comparison of Energy Minimization Algorithms for Highly Connected Graphs. ECCV (2) 2006: 1-15 - [c17]Richard Szeliski, Ramin Zabih, Daniel Scharstein, Olga Veksler, Vladimir Kolmogorov, Aseem Agarwala, Marshall F. Tappen, Carsten Rother:
A Comparative Study of Energy Minimization Methods for Markov Random Fields. ECCV (2) 2006: 16-29 - [c16]Yuri Boykov, Vladimir Kolmogorov, Daniel Cremers, Andrew Delong:
An Integral Solution to Surface Evolution PDEs Via Geo-cuts. ECCV (3) 2006: 409-422 - [p1]Vladimir Kolmogorov, Ramin Zabih:
Graph Cut Algorithms for Binocular Stereo with Occlusions. Handbook of Mathematical Models in Computer Vision 2006: 423-437 - 2005
- [c15]Vladimir Kolmogorov:
Convergent tree-reweighted message passing for energy minimization. AISTATS 2005 - [c14]Vladimir Kolmogorov, Antonio Criminisi, Andrew Blake, Geoffrey Cross, Carsten Rother:
Bi-Layer Segmentation of Binocular Stereo Video. CVPR (2) 2005: 407-414 - [c13]Carsten Rother, Sanjiv Kumar, Vladimir Kolmogorov, Andrew Blake:
Digital Tapestry. CVPR (1) 2005: 589-596 - [c12]Vladimir Kolmogorov, Antonio Criminisi, Andrew Blake, Geoffrey Cross, Carsten Rother:
Bi-Layer Segmentation of Binocular Stereo Video. CVPR (2) 2005: 1186 - [c11]Vladimir Kolmogorov, Yuri Boykov:
What Metrics Can Be Approximated by Geo-Cuts, Or Global Optimization of Length/Area and Flux. ICCV 2005: 564-571 - [c10]Andrew Blake, Antonio Criminisi, Geoffrey Cross, Vladimir Kolmogorov, Carsten Rother:
Fusion of Stereo, Colour and Contrast. ISRR 2005: 295-304 - [c9]Vladimir Kolmogorov, Martin J. Wainwright:
On the Optimality of Tree-reweighted Max-product Message-passing. UAI 2005: 316-323 - 2004
- [b1]Vladimir Kolmogorov:
Graph Based Algorithms for Scene Reconstruction from Two or More Views. Cornell University, USA, 2004 - [j3]Vladimir Kolmogorov, Ramin Zabih:
What Energy Functions Can Be Minimized via Graph Cuts? IEEE Trans. Pattern Anal. Mach. Intell. 26(2): 147-159 (2004) - [j2]Yuri Boykov, Vladimir Kolmogorov:
An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision. IEEE Trans. Pattern Anal. Mach. Intell. 26(9): 1124-1137 (2004) - [j1]Carsten Rother, Vladimir Kolmogorov, Andrew Blake:
"GrabCut": interactive foreground extraction using iterated graph cuts. ACM Trans. Graph. 23(3): 309-314 (2004) - [c8]Ramin Zabih, Vladimir Kolmogorov:
Spatially Coherent Clustering Using Graph Cuts. CVPR (2) 2004: 437-444 - 2003
- [c7]Vladimir Kolmogorov, Ramin Zabih, Steven J. Gortler:
Generalized Multi-camera Scene Reconstruction Using Graph Cuts. EMMCVPR 2003: 501-516 - [c6]Yuri Boykov, Vladimir Kolmogorov:
Computing Geodesics and Minimal Surfaces via Graph Cuts. ICCV 2003: 26-33 - [c5]Junhwan Kim, Vladimir Kolmogorov, Ramin Zabih:
Visual Correspondence Using Energy Minimization and Mutual Information. ICCV 2003: 1033-1040 - 2002
- [c4]Vladimir Kolmogorov, Ramin Zabih:
What Energy Functions Can Be Minimized via Graph Cuts? ECCV (3) 2002: 65-81 - [c3]Vladimir Kolmogorov, Ramin Zabih:
Multi-camera Scene Reconstruction via Graph Cuts. ECCV (3) 2002: 82-96 - 2001
- [c2]Yuri Boykov,