Vladimir Kolmogorov

Affiliations:
  • Institute of Sciente and Technology, Austria


According to our database1, Vladimir Kolmogorov authored at least 94 papers between 2001 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A simpler and parallelizable O(√log n)-approximation algorithm for Sparsest Cut.
CoRR, 2023

Parameter Estimation for Gibbs Distributions.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Solving Relaxations of MAP-MRF Problems: Combinatorial in-Face Frank-Wolfe Directions.
Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2023

2022
Combining pattern-based CRFs and weighted context-free grammars.
Intell. Data Anal., 2022

OrderedCuts: A new approach for computing Gomory-Hu tree.
CoRR, 2022

A computational study of Gomory-Hu tree algorithms.
CoRR, 2022

2021
Generalized minimum 0-extension problem and discrete convexity.
CoRR, 2021

One-sided Frank-Wolfe algorithms for saddle problems.
Proceedings of the 38th International Conference on Machine Learning, 2021

A New Notion of Commutativity for the Algorithmic Lovász Local Lemma.
Proceedings of the Approximation, 2021

2020
Practical Frank-Wolfe algorithms.
CoRR, 2020

2019
Even Delta-Matroids and the Complexity of Planar Boolean CSPs.
ACM Trans. Algorithms, 2019

A Local Lemma for Focused Stochastic Algorithms.
SIAM J. Comput., 2019

Function Norms for Neural Networks.
Proceedings of the 2019 IEEE/CVF International Conference on Computer Vision Workshops, 2019

Testing the Complexity of a Valued CSP Language.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

MAP Inference via Block-Coordinate Frank-Wolfe Algorithm.
Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2019

2018
Commutativity in the Algorithmic Lovász Local Lemma.
SIAM J. Comput., 2018

Superconcentrators of Density 25.3.
Ars Comb., 2018

Efficient Optimization for Rank-Based Loss Functions.
Proceedings of the 2018 IEEE Conference on Computer Vision and Pattern Recognition, 2018

A Faster Approximation Algorithm for the Gibbs Partition Function.
Proceedings of the Conference On Learning Theory, 2018

2017
The Complexity of General-Valued CSPs.
SIAM J. Comput., 2017

2016
Total Variation on a Tree.
SIAM J. Imaging Sci., 2016

On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model.
IACR Cryptol. ePrint Arch., 2016

Inference Algorithms for Pattern-Based CRFs on Sequence Data.
Algorithmica, 2016

2015
The Power of Linear Programming for General-Valued CSPs.
SIAM J. Comput., 2015

A New Look at Reweighted Message Passing.
IEEE Trans. Pattern Anal. Mach. Intell., 2015

Commutativity in the Random Walk formulation of the Lovasz Local Lemma.
CoRR, 2015

Effectiveness of Structural Restrictions for Hybrid CSPs.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

A multi-plane block-coordinate frank-wolfe algorithm for training structural SVMs with a costly max-oracle.
Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2015

2014
Kolmogorov and Zabih's Graph Cuts Stereo Matching Algorithm.
Image Process. Line, 2014

A Multi-Plane Block-Coordinate Frank-Wolfe Algorithm for Structural SVMs with a Costly max-Oracle.
CoRR, 2014

Proceedings of The 38th Annual Workshop of the Austrian Association for Pattern Recognition (ÖAGM), 2014.
CoRR, 2014

Tree-Reweighted Message Passing.
Proceedings of the Tractability: Practical Approaches to Hard Problems, 2014

2013
A Dual Decomposition Approach to Feature Correspondence.
IEEE Trans. Pattern Anal. Mach. Intell., 2013

The complexity of conservative valued CSPs.
J. ACM, 2013

Proofs of Space.
IACR Cryptol. ePrint Arch., 2013

Reweighted message passing revisited.
CoRR, 2013

Partial Enumeration and Curvature Regularization.
Proceedings of the IEEE International Conference on Computer Vision, 2013

Potts Model, Parametric Maxflow and K-Submodular Functions.
Proceedings of the IEEE International Conference on Computer Vision, 2013

The Power of Linear Programming for Finite-Valued CSPs: A Constructive Characterization.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Computing the M Most Probable Modes of a Graphical Model.
Proceedings of the Sixteenth International Conference on Artificial Intelligence and Statistics, 2013

Optimal Coalition Structure Generation in Cooperative Graph Games.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012
Minimizing a sum of submodular functions.
Discret. Appl. Math., 2012

Generalized roof duality and bisubmodular functions.
Discret. Appl. Math., 2012

The power of linear programming for valued CSPs: a constructive characterization
CoRR, 2012

Generalized sequential tree-reweighted message passing
CoRR, 2012

Towards Minimizing k-Submodular Functions.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011
Optimal Coalition Structures in Graph Games
CoRR, 2011

Submodularity on a Tree: Unifying $L^\natural$ -Convex and Bisubmodular Functions.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Dynamic Tree Block Coordinate Ascent.
Proceedings of the 28th International Conference on Machine Learning, 2011

Object cosegmentation.
Proceedings of the 24th IEEE Conference on Computer Vision and Pattern Recognition, 2011

Submodular decomposition framework for inference in associative Markov networks with global constraints.
Proceedings of the 24th IEEE Conference on Computer Vision and Pattern Recognition, 2011

Team coverage games.
Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

2010
A dichotomy theorem for conservative general-valued CSPs
CoRR, 2010

Generalising tractable VCSPs defined by symmetric tournament pair multimorphisms
CoRR, 2010

The complexity of conservative finite-valued CSPs
CoRR, 2010

A Faster Algorithm for Computing the Principal Sequence of Partitions of a Graph.
Algorithmica, 2010

Cosegmentation Revisited: Models and Optimization.
Proceedings of the Computer Vision, 2010

2009
Blossom V: a new implementation of a minimum cost perfect matching algorithm.
Math. Program. Comput., 2009

An Analysis of Convex Relaxations for MAP Estimation of Discrete MRFs.
J. Mach. Learn. Res., 2009

New algorithms for convex cost tension problem with application to computer vision.
Discret. Optim., 2009

A global perspective on MAP inference for low-level vision.
Proceedings of the IEEE 12th International Conference on Computer Vision, ICCV 2009, Kyoto, Japan, September 27, 2009

Joint optimization of segmentation and appearance models.
Proceedings of the IEEE 12th International Conference on Computer Vision, ICCV 2009, Kyoto, Japan, September 27, 2009

2008
A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors.
IEEE Trans. Pattern Anal. Mach. Intell., 2008

Probabilistic Fusion of Stereo with Color and Contrast for Bi-Layer Segmentation.
Int. J. Comput. Vis., 2008

On partial optimality in multi-label MRFs.
Proceedings of the Machine Learning, 2008

Feature Correspondence Via Graph Matching: Models and Global Optimization.
Proceedings of the Computer Vision, 2008

Graph cut based image segmentation with connectivity priors.
Proceedings of the 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2008), 2008

2007
Minimizing Nonsubmodular Functions with Graph Cuts-A Review.
IEEE Trans. Pattern Anal. Mach. Intell., 2007

An Analysis of Convex Relaxations for MAP Estimation.
Proceedings of the Advances in Neural Information Processing Systems 20, 2007

Applications of parametric maxflow in computer vision.
Proceedings of the IEEE 11th International Conference on Computer Vision, 2007

Optimizing Binary MRFs via Extended Roof Duality.
Proceedings of the 2007 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2007), 2007

2006
Probabilistic Fusion of Stereo with Color and Contrast for Bilayer Segmentation.
IEEE Trans. Pattern Anal. Mach. Intell., 2006

Convergent Tree-Reweighted Message Passing for Energy Minimization.
IEEE Trans. Pattern Anal. Mach. Intell., 2006

A Comparative Study of Energy Minimization Methods for Markov Random Fields.
Proceedings of the Computer Vision, 2006

Comparison of Energy Minimization Algorithms for Highly Connected Graphs.
Proceedings of the Computer Vision, 2006

An Integral Solution to Surface Evolution PDEs Via Geo-cuts.
Proceedings of the Computer Vision, 2006

Cosegmentation of Image Pairs by Histogram Matching - Incorporating a Global Constraint into MRFs.
Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2006), 2006

Bilayer Segmentation of Live Video.
Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2006), 2006

Graph Cut Algorithms for Binocular Stereo with Occlusions.
Proceedings of the Handbook of Mathematical Models in Computer Vision, 2006

2005
On the Optimality of Tree-reweighted Max-product Message-passing.
Proceedings of the UAI '05, 2005

Fusion of Stereo, Colour and Contrast.
Proceedings of the Robotics Research: Results of the 12th International Symposium, 2005

What Metrics Can Be Approximated by Geo-Cuts, Or Global Optimization of Length/Area and Flux.
Proceedings of the 10th IEEE International Conference on Computer Vision (ICCV 2005), 2005

Digital Tapestry.
Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2005), 2005

Bi-Layer Segmentation of Binocular Stereo Video.
Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2005), 2005

2004
Graph Based Algorithms for Scene Reconstruction from Two or More Views.
PhD thesis, 2004

"GrabCut": interactive foreground extraction using iterated graph cuts.
ACM Trans. Graph., 2004

What Energy Functions Can Be Minimized via Graph Cuts?
IEEE Trans. Pattern Anal. Mach. Intell., 2004

An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision.
IEEE Trans. Pattern Anal. Mach. Intell., 2004

Spatially Coherent Clustering Using Graph Cuts.
Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2004), with CD-ROM, 27 June, 2004

2003
Visual Correspondence Using Energy Minimization and Mutual Information.
Proceedings of the 9th IEEE International Conference on Computer Vision (ICCV 2003), 2003

Computing Geodesics and Minimal Surfaces via Graph Cuts.
Proceedings of the 9th IEEE International Conference on Computer Vision (ICCV 2003), 2003

Generalized Multi-camera Scene Reconstruction Using Graph Cuts.
Proceedings of the Energy Minimization Methods in Computer Vision and Pattern Recognition, 2003

2002
Multi-camera Scene Reconstruction via Graph Cuts.
Proceedings of the Computer Vision, 2002

2001
Computing Visual Correspondence with Occlusions via Graph Cuts.
Proceedings of the Eighth International Conference On Computer Vision (ICCV-01), Vancouver, British Columbia, Canada, July 7-14, 2001, 2001


  Loading...