19 citations · 34 across the 3 of their papers we have counts for
3 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…
cs.AI2012★ 4 cited
Bounding Search Space Size via (Hyper)tree Decompositions
Lars Otten, Rina Dechter
This paper develops a measure for bounding the performance of AND/OR search algorithms for solving a variety of queries over graphical models. We show how drawing a connection to t…