Irina Rish
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Irina Rish has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Daniel Frost
University of California
1 shared publication - Kalev Kask
Department of Information and Computer Science University of California 92697-3425 Irvine CA
1 shared publication - Rina Dechter
University of California, Irvine
1 shared publication
Latest Publications
- Open Access
Empirical Evaluation of Approximation Algorithms for Probabilistic Decoding
It was recently shown that the problem of decoding messages transmitted through a noisy channel can be formulated as a belief updating task over a probabilistic network [McEliece]. Moreover, it was observed that iterative application of the (linear time) Pearl's belief propagation algorithm designed for polytrees outperformed state of the art decoding algorithms, even though the corresponding networks may have many cycles. This paper demonstrates empirically that an approximation algorithm approx-mpe for solving the most probable explanation (MPE) problem, developed within the recently proposed mini-bucket elimination framework [Dechter96], outperforms iterative belief propagation on classes of coding networks that have bounded induced width. Our experiments suggest that approximate MPE decoders can be good competitors to the approximate belief updating decoders.
Open AccessEmpirical Evaluation of Approximation Algorithms for Probabilistic Decoding
It was recently shown that the problem of decoding messages transmitted through a noisy channel can be formulated as a belief updating task over a probabilistic network [McEliece]. Moreover, it was observed that iterative application of the (linear time) Pearl's belief propagation algorithm designed for polytrees outperformed state of the art decoding algorithms, even though the corresponding networks may have many cycles. This paper demonstrates empirically that an approximation algorithm approx-mpe for solving the most probable explanation (MPE) problem, developed within the recently proposed mini-bucket elimination framework [Dechter96], outperforms iterative belief propagation on classes of coding networks that have bounded induced width. Our experiments suggest that approximate MPE decoders can be good competitors to the approximate belief updating decoders.
- 1 January 1997
- Published by Springer Nature
- p. 150-162
Statistical analysis of backtracking on inconsistent CSPs
- 1 January 1997
- Published by Springer Nature
- p. 150-162
Statistical analysis of backtracking on inconsistent CSPs