LP Relaxation of the Potts Labeling Problem Is as Hard as Any Linear Program
In our recent work, we showed that solving the LP relaxation of the pairwise min-sum labeling problem (also known as MAP inference in graphical models or discrete energy minimization) is not much easier than solving any linear program. Precisely, the general linear program reduces in linear time (as...
| Publié dans: | IEEE transactions on pattern analysis and machine intelligence. - 1979. - 39(2017), 7 vom: 18. Juli, Seite 1469-1475 |
|---|---|
| Auteur principal: | |
| Autres auteurs: | |
| Format: | Article en ligne |
| Langue: | English |
| Publié: |
2017
|
| Accès à la collection: | IEEE transactions on pattern analysis and machine intelligence |
| Sujets: | Journal Article Research Support, Non-U.S. Gov't |
| Accès en ligne |
Volltext |