Fast inference with min-sum matrix product
The MAP inference problem in many graphical models can be solved efficiently using a fast algorithm for computing min-sum products of n × n matrices. The class of models in question includes cyclic and skip-chain models that arise in many applications. A
|Collections||ANU Research Publications|
|Source:||IEEE Transactions on Pattern Analysis and Machine Intelligence|
|01_Felzenszwalb_Fast_inference_with_min-sum_2011.pdf||667.32 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.