Year |
Citation |
Score |
2019 |
Kazda A, Kolmogorov V, Rolínek M. Even delta-matroids and the complexity of planar boolean CSPs Acm Transactions On Algorithms. 15: 1-33. DOI: 10.1145/3230649 |
0.463 |
|
2019 |
Achlioptas D, Iliopoulos F, Kolmogorov V. A Local Lemma for Focused Stochastic Algorithms Siam Journal On Computing. 48: 1583-1602. DOI: 10.1137/16M109332X |
0.392 |
|
2018 |
Kolmogorov V. Commutativity in the Algorithmic Lovász Local Lemma Siam Journal On Computing. 47: 2029-2056. DOI: 10.1137/16M1093306 |
0.416 |
|
2016 |
Kolmogorov V, Pock T, Rolinek M. Total variation on a tree Siam Journal On Imaging Sciences. 9: 605-636. DOI: 10.1137/15M1010257 |
0.472 |
|
2015 |
Kolmogorov V. A New Look at Reweighted Message Passing. Ieee Transactions On Pattern Analysis and Machine Intelligence. 37: 919-30. PMID 26353318 DOI: 10.1109/Tpami.2014.2363465 |
0.362 |
|
2015 |
Kolmogorov V, Krokhin A, Rolinek M. The Complexity of General-Valued CSPs Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 2015: 1246-1258. DOI: 10.1137/16M1091836 |
0.351 |
|
2015 |
Shah N, Kolmogorov V, Lampert CH. A multi-plane block-coordinate frank-wolfe algorithm for training structural SVMs with a costly max-oracle Proceedings of the Ieee Computer Society Conference On Computer Vision and Pattern Recognition. 7: 2737-2745. DOI: 10.1109/CVPR.2015.7298890 |
0.362 |
|
2014 |
Kolmogorov V, Monasse P, Tan P. Kolmogorov and Zabih's Graph Cuts Stereo Matching Algorithm Image Processing On Line. 4: 220-251. DOI: 10.5201/Ipol.2014.97 |
0.56 |
|
2013 |
Torresani L, Kolmogorov V, Rother C. A dual decomposition approach to feature correspondence. Ieee Transactions On Pattern Analysis and Machine Intelligence. 35: 259-71. PMID 22566465 DOI: 10.1109/Tpami.2012.105 |
0.497 |
|
2013 |
Takhanov R, Kolmogorov V. Inference algorithms for pattern-based CRFs on sequence data 30th International Conference On Machine Learning, Icml 2013. 1182-1190. DOI: 10.1007/S00453-015-0017-7 |
0.389 |
|
2013 |
Bachrach Y, Kohli P, Kolmogorov V, Zadimoghaddam M. Optimal coalition structure generation in cooperative graph games Proceedings of the 27th Aaai Conference On Artificial Intelligence, Aaai 2013. 81-87. |
0.319 |
|
2012 |
Kolmogorov V. Minimizing a sum of submodular functions Discrete Applied Mathematics. 160: 2246-2258. DOI: 10.1016/J.Dam.2012.05.025 |
0.433 |
|
2011 |
Osokin A, Vetrov D, Kolmogorov V. Submodular decomposition framework for inference in associative Markov networks with global constraints Proceedings of the Ieee Computer Society Conference On Computer Vision and Pattern Recognition. 1889-1896. DOI: 10.1109/CVPR.2011.5995361 |
0.308 |
|
2011 |
Kolmogorov V. Tree-reweighted message passing Tractability. 175-201. DOI: 10.1017/CBO9781139177801.076 |
0.37 |
|
2010 |
Kolmogorov V. A faster algorithm for computing the principal sequence of partitions of a graph Algorithmica (New York). 56: 394-412. DOI: 10.1007/S00453-008-9177-Z |
0.445 |
|
2009 |
Woodford OJ, Rother C, Kolmogorov V. A global perspective on MAP inference for low-level vision Proceedings of the Ieee International Conference On Computer Vision. 2319-2326. DOI: 10.1109/ICCV.2009.5459434 |
0.322 |
|
2009 |
Kolmogorov V, Shioura A. New algorithms for convex cost tension problem with application to computer vision Discrete Optimization. 6: 378-393. DOI: 10.1016/J.Disopt.2009.04.006 |
0.481 |
|
2009 |
Kolmogorov V. Blossom V: A new implementation of a minimum cost perfect matching algorithm Mathematical Programming Computation. 1: 43-67. DOI: 10.1007/S12532-009-0002-8 |
0.486 |
|
2008 |
Szeliski R, Zabih R, Scharstein D, Veksler O, Kolmogorov V, Agarwala A, Tappen M, Rother C. A comparative study of energy minimization methods for Markov random fields with smoothness-based priors. Ieee Transactions On Pattern Analysis and Machine Intelligence. 30: 1068-80. PMID 18421111 DOI: 10.1109/Tpami.2007.70844 |
0.706 |
|
2008 |
Vicente S, Kolmogorov V, Rother C. Graph cut based image segmentation with connectivity priors 26th Ieee Conference On Computer Vision and Pattern Recognition, Cvpr. DOI: 10.1109/CVPR.2008.4587440 |
0.305 |
|
2008 |
Torresani L, Kolmogorov V, Rother C. Feature correspondence via graph matching: Models and global optimization Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5303: 596-609. DOI: 10.1007/978-3-540-88688-4-44 |
0.413 |
|
2008 |
Kohli P, Shekhovtsov A, Rother C, Kolmogorov V, Torr P. On partial optimality in multi-label MRFs Proceedings of the 25th International Conference On Machine Learning. 480-487. |
0.325 |
|
2007 |
Kolmogorov V, Rother C. Minimizing nonsubmodular functions with graph cuts - a review. Ieee Transactions On Pattern Analysis and Machine Intelligence. 29: 1274-9. PMID 17496384 DOI: 10.1109/Tpami.2007.1031 |
0.457 |
|
2006 |
Kolmogorov V. Convergent tree-reweighted message passing for energy minimization. Ieee Transactions On Pattern Analysis and Machine Intelligence. 28: 1568-83. PMID 16986540 DOI: 10.1109/Tpami.2006.200 |
0.507 |
|
2006 |
Kolmogorov V, Criminisi A, Blake A, Cross G, Rother C. Probabilistic fusion of stereo with color and contrast for bilayer segmentation. Ieee Transactions On Pattern Analysis and Machine Intelligence. 28: 1480-92. PMID 16929733 DOI: 10.1109/Tpami.2006.193 |
0.448 |
|
2006 |
Rother C, Kolmogorov V, Minka T, Blake A. Cosegmentation of image pairs by histogram matching - Incorporating a global constraint into MRFs Proceedings of the Ieee Computer Society Conference On Computer Vision and Pattern Recognition. 1: 994-1000. DOI: 10.1109/CVPR.2006.91 |
0.352 |
|
2006 |
Kolmogorov V, Rother G. Comparison of energy minimization algorithms for highly connected graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3952: 1-15. DOI: 10.1007/11744047_1 |
0.481 |
|
2006 |
Kolmogorov V, Zabih R. Graph cut algorithms for binocular stereo with occlusions Handbook of Mathematical Models in Computer Vision. 423-437. DOI: 10.1007/0-387-28831-7_26 |
0.706 |
|
2004 |
Boykov Y, Kolmogorov V. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. Ieee Transactions On Pattern Analysis and Machine Intelligence. 26: 1124-37. PMID 15742889 DOI: 10.1109/Tpami.2004.60 |
0.496 |
|
2004 |
Kolmogorov V, Zabih R. What energy functions can be minimized via graph cuts? Ieee Transactions On Pattern Analysis and Machine Intelligence. 26: 147-59. PMID 15376891 DOI: 10.1109/Tpami.2004.1262177 |
0.68 |
|
2004 |
Kolmogorov V, Nguyen TD, Nuval A, Spincemaille P, Prince MR, Zabih R, Wang Y. Multiprocessor scheduling implementation of the simultaneous multiple volume (SMV) navigator method. Magnetic Resonance in Medicine. 52: 362-7. PMID 15282819 DOI: 10.1002/Mrm.20162 |
0.613 |
|
2004 |
Zabih R, Kolmogorov V. Spatially coherent clustering using graph cuts Proceedings of the Ieee Computer Society Conference On Computer Vision and Pattern Recognition. 2. |
0.575 |
|
2003 |
Kolmogorov VN, Watts R, Prince MR, Zabih R, Wang Y. Simultaneous multiple volume (SMV) acquisition algorithm for real-time navigator gating. Magnetic Resonance Imaging. 21: 969-75. PMID 14684198 DOI: 10.1016/S0730-725X(03)00203-0 |
0.608 |
|
2003 |
Kim J, Kolmogorov V, Zabih R. Visual correspondence using energy minimization and mutual information Proceedings of the Ieee International Conference On Computer Vision. 2: 1033-1040. |
0.64 |
|
2003 |
Kolmogorov V, Zabih R, Gortler S. Generalized multi-camera scene reconstruction using graph cuts Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2683: 501-516. |
0.699 |
|
2003 |
Boykov Y, Kolmogorov V. Computing geodesics and minimal surfaces via graph cuts Proceedings of the Ieee International Conference On Computer Vision. 1: 26-33. |
0.378 |
|
2002 |
Kolmogorov V, Zabih R. Multi-camera scene reconstruction via graph cuts Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2352: 82-96. |
0.698 |
|
2001 |
Kolmogorov V, Zabih R. Computing visual correspondence with occlusions using graph cuts Proceedings of the Ieee International Conference On Computer Vision. 2: 508-515. |
0.67 |
|
Show low-probability matches. |