Fast inference with min-sum matrix product

Simple item page
dc.contributor.authorFelzenszwalb, Pedro F.
dc.contributor.authorMcAuley, Julian
dc.date.accessioned2015-12-10T22:21:33Z
dc.date.issued2011
dc.date.updated2016-02-24T08:58:24Z
dc.description.abstractThe 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
dc.identifier.issn0162-8828
dc.identifier.urihttp://hdl.handle.net/1885/52265
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE Inc)
dc.sourceIEEE Transactions on Pattern Analysis and Machine Intelligence
dc.subjectKeywords: Expected time; Fast algorithms; Fast inference; GraphicaL model; Inference problem; Input matrices; Matrix products; Min-sum; NAtural language processing; Performance Gain; Product operations; Uniform distribution; Worst-case complexity; Algorithms; Compu Graphical models; MAP inference; min-sum matrix product
dc.titleFast inference with min-sum matrix product
dc.typeJournal article
local.bibliographicCitation.issue12
local.bibliographicCitation.lastpage2554
local.bibliographicCitation.startpage2549
local.contributor.affiliationFelzenszwalb, Pedro F., University of Chicago
local.contributor.affiliationMcAuley, Julian, College of Engineering and Computer Science, ANU
local.contributor.authoruidMcAuley, Julian, u4291439
local.description.embargo2037-12-31
local.description.notesImported from ARIES
local.identifier.absfor080299 - Computation Theory and Mathematics not elsewhere classified
local.identifier.ariespublicationf5625xPUB243
local.identifier.citationvolume33
local.identifier.doi10.1109/TPAMI.2011.121
local.identifier.scopusID2-s2.0-80054887189
local.type.statusPublished Version

Downloads

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
01_Felzenszwalb_Fast_inference_with_min-sum_2011.pdf
Size:
667.32 KB
Format:
Adobe Portable Document Format
Download

Collections

ANU Research Publications

DSpace software copyright © 2002-2026 LYRASIS