70 citations · 466 across the 19 of their papers we have counts for
10 papers · 2 filters
Iterative Join-Graph Propagation
Rina Dechter, Kalev Kask, Robert Mateescu
The paper presents an iterative version of join-tree clustering that applies the message passing of join-tree clustering algorithm to join-graphs rather than to join-trees, iterati…
Systematic vs. Non-systematic Algorithms for Solving the MPE Task
Radu Marinescu, Kalev Kask, Rina Dechter
The paper continues the study of partitioning based inference of heuristics for search in the context of solving the Most Probable Explanation task in Bayesian Networks. We compare…
A Simple Insight into Iterative Belief Propagation's Success
Rina Dechter, Robert Mateescu
In Non - ergodic belief networks the posterior belief OF many queries given evidence may become zero.The paper shows that WHEN belief propagation IS applied iteratively OVER arbitr…
An Empirical Study of w-Cutset Sampling for Bayesian Networks
Bozhena Bidyuk, Rina Dechter
The paper studies empirically the time-space trade-off between sampling and inference in a sl cutset sampling algorithm. The algorithm samples over a subset of nodes in a Bayesian…
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…
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…