70 citations · 187 across the 12 of their papers we have counts for
7 papers · 1 filter
Join-Graph Propagation Algorithms
Robert Mateescu, Kalev Kask, Vibhav Gogate +1
The paper investigates parameterized approximate message-passing schemes that are based on bounded inference and are inspired by Pearl's belief propagation algorithm (BP). We start…
AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models
Robert Mateescu, Rina Dechter, Radu Marinescu
Inspired by the recently introduced framework of AND/OR search spaces for graphical models, we propose to augment Multi-Valued Decision Diagrams (MDD) with AND nodes, in order to c…
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…
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…
Mixtures of Deterministic-Probabilistic Networks and their AND/OR Search Space
Rina Dechter, Robert Mateescu
The paper introduces mixed networks, a new framework for expressing and reasoning with probabilistic and deterministic information. The framework combines belief networks with cons…
The Relationship Between AND/OR Search and Variable Elimination
Robert Mateescu, Rina Dechter
In this paper we compare search and inference in graphical models through the new framework of AND/OR search. Specifically, we compare Variable Elimination (VE) and memoryintensive…