Complexity of Discrete Energy Minimization Problems-Reference-Cited by-同舟云学术

Complexity of Discrete Energy Minimization Problems

Published:2016 Issue: Volume: Page:834-852
ISSN:0302-9743
Container-title:Computer Vision – ECCV 2016
language:
Short-container-title:

Author:

Li Mengtian,Shekhovtsov Alexander,Huber Daniel

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-46475-6_51

Reference72 articles.

1. The Probabilistic Inference Challenge (2011). http://www.cs.huji.ac.il/project/PASCAL/

2. Abdelbar, A., Hedetniemi, S.: Approximating MAPs for belief networks is NP-hard and other theorems. Artif. Intell. 102(1), 21–38 (1998)

3. Lecture Notes in Computer Science;C Arora,2012

4. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Heidelberg (1999)

5. Bach, S.H., Huang, B., Getoor, L.: Unifying local consistency and MAX SAT relaxations for scalable inference with rounding guarantees. In: AISTATS, JMLR Proceedings, vol. 38 (2015)

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Experimental Verification of the Self-Driven Algorithms for Solving Max-Sum Labeling Problems;Kibernetika i vyčislitelʹnaâ tehnika;2023-04-21

2. Efficient and Flexible Sublabel-Accurate Energy Minimization;2022 26th International Conference on Pattern Recognition (ICPR);2022-08-21

3. Self-Driven Algorithm for Solving Supermodular (max,+) Labeling Problems Based on Subgradient Descent*;Cybernetics and Systems Analysis;2022-07

4. Non-parametric scene parsing: Label transfer methods and datasets;Computer Vision and Image Understanding;2022-06

5. Tighter continuous relaxations for MAP inference in discrete MRFs: A survey;Handbook of Numerical Analysis;2019