Universality of the Local Marginal Polytope

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F13%3A00212548" target="_blank" >RIV/68407700:21230/13:00212548 - isvavai.cz</a>
Result on the web
<a href="http://cmp.felk.cvut.cz/pub/cvl/articles/prusa/PrusaWernerCVPR2013.pdf" target="_blank" >http://cmp.felk.cvut.cz/pub/cvl/articles/prusa/PrusaWernerCVPR2013.pdf</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/CVPR.2013.227" target="_blank" >10.1109/CVPR.2013.227</a>

Result language
angličtina
Original language name
Universality of the Local Marginal Polytope
Original language description
We show that solving the LP relaxation of the MAP inference problem in graphical models (also known as the min-sum problem, energy minimization, or weighted constraint satisfaction) is not easier than solving any LP. More precisely, any polytope is linear-time representable by a local marginal polytope and any LP can be reduced in linear time to a linear optimization (allowing infinite weights) over a local marginal polytope.
Czech name
—
Czech description
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
CVPR: 2013 IEEE Computer Society Conference on Computer Vision and Pattern Recognition
ISBN
—
ISSN
1063-6919
e-ISSN
—
Number of pages
6
Pages from-to
1738-1743
Publisher name
IEEE Computer Society Press
Place of publication
Los Alamitos
Event location
OR
Event date
Jun 25, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)