19 citations · 30 across the 2 of their papers we have counts for
2 papers
cs.AI2012★ 11 cited
A Case Study in Complexity Estimation: Towards Parallel Branch-and-Bound over Graphical Models
Lars Otten, Rina Dechter
We study the problem of complexity estimation in the context of parallelizing an advanced Branch and Bound-type algorithm over graphical models. The algorithm's pruning power makes…
cs.AI2012★ 19 cited
Join-graph based cost-shifting schemes
Alexander T. Ihler, Natalia Flerova, Rina Dechter +1
We develop several algorithms taking advantage of two common approaches for bounding MPE queries in graphical models: minibucket elimination and message-passing updates for linear…