Research map / Learning theory and algorithms / Submodular and game algorithms
Complexity of Discrete Energy Minimization Problems
Mengtian Li, Alexander Shekhovtsov, Daniel Huber
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Automatically Selecting Inference Algorithms for Discrete Energy Minimisation (ECCV 2016 · similarity 0.90)
- Local Submodularization for Binary Pairwise Energies (TPAMI 2016 · similarity 0.88)
- Parametric Majorization for Data-Driven Energy Minimization Methods (ICCV 2019 · similarity 0.87)
- An Inference Algorithm for Multi-Label MRF-MAP Problems with Clique Size 100 (ECCV 2020 · similarity 0.87)
- Sublabel-Accurate Convex Relaxation of Vectorial Multilabel Energies (ECCV 2016 · similarity 0.86)
- Joint Learning of Energy-based Models and their Partition Function (ICML 2025 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
