70 citations · 120 across the 6 of their papers we have counts for
6 papers
Repair-Optimal MDS Array Codes over GF(2)
Eyal En Gad, Robert Mateescu, Filip Blagojevic +2
Maximum-distance separable (MDS) array codes with high rate and an optimal repair property were introduced recently. These codes could be applied in distributed storage systems, wh…
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…
AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Weighted Graphical Models
Robert Mateescu, Rina Dechter
Compiling graphical models has recently been under intense investigation, especially for probabilistic modeling and processing. We present here a novel data structure for compiling…