An LP View of the M-Best MAP Problem thumbnail
Pause
Mute
Subtitles not available
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

An LP View of the M-Best MAP Problem

Published on Jan 19, 20103547 Views

We consider the problem of finding the M assignments with maximum probability in a probabilistic graphical model. We show how this problem can be formulated as a linear program (LP) on a particular po

Related categories