Rina Dechter, Irina Rish  Home/Search
Context Related
| uci.edu/~csp/r62a.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: uci.edu/~dechter/publications/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The paper presents a class of approximation algorithms that extend the idea of bounded-complexityinference, inspired by successful constraint propagation algorithms, to probabilistic inference and combinatorial optimization. (Update)
Cited by: More
Focused Inference - Rosales, Jaakkola (Correct)
Annealed MAP - Yuan, Lu, Druzdzel (Correct)
AND/OR Tree Search for Constraint Optimization - Radu Marinescu And (Correct)
Similar documents (at the sentence level):
14.6%: Mini-Buckets: A General Scheme for Approximating Inference - Dechter, Rish (1998) (Correct)
Active bibliography (related documents): More All
0.8: Systematic vs. Non-systematic Algorithms for Solving the MPE.. - Radu Marinescu Kalev (Correct)
0.5: Partition-based Anytime Approximation for Belief Updating - Mateescu, Dechter, Kask (2001) (Correct)
0.4: Empirical Evaluation of Approximation Algorithms for.. - Rish, Kask, Dechter (1998) (Correct)
Similar documents based on text: More All
0.5: Directional Resolution: The Davis-Putnam Procedure, Revisited - Dechter, Rish (1994) (Correct)
0.5: A Scheme for Approximating Probabilistic Inference - Dechter, Rish (1997) (Correct)
0.5: Empirical evaluation of two versions of the Davis-Putnam.. - Dechter, Rish (Correct)
Related documents from co-citation: More All
4: Bucket elimination: A unifying framework for reasoning - Dechter - 1999
3: Local computations with probabilities on graphical structures and their applicat.. (context) - Lauritzen, Spiegelhalter - 1988
2: Probabilistic Reasoning in Intelligent Systems (context) - Pearl - 1988
BibTeX entry: (Update)
K. Dechter. Mini-buckets: A general scheme for approximating inference. ICS Technical Report, 1998. http://citeseer.ist.psu.edu/dechter98minibuckets.html More
@misc{ dechter98minibuckets,
author = "K. Dechter",
title = "Mini-buckets: A general scheme for approximating inference",
text = "K. Dechter. Mini-buckets: A general scheme for approximating inference.
ICS Technical Report, 1998.",
year = "1998",
url = "citeseer.ist.psu.edu/dechter98minibuckets.html" }
Citations (may not include all citations):702 Consistency in networks of relations (context) - Mackworth - 1977
582 Local computation with probabilities on graphical structures.. (context) - Lauritzen, Spiegelhalter - 1988
459 A computing procedure for quantification theory (context) - Davis, Putnam - 1960
402 An analysis of time-dependent planning (context) - Dean, Boddy - 1988
284 The computational complexity of probabilistic inference usin.. (context) - Cooper - 1990
267 Network-based heuristics for constraint satisfaction problem.. (context) - Dechter, Pearl - 1987
245 An Introduction to Variational Methods for Graphical Models - Jordan, Ghahramani et al. - 1998
189 Solving time-dependent planning problems (context) - Boddy, Dean - 1989
185 A sufficient condition for backtrack-free search (context) - Freuder - 1982
166 Synthesizing constraint expressions (context) - Freuder - 1978
132 Bucket elimination: A unifying framework for probabilistic i.. - Dechter - 1996
115 Graphical models for machine learning and digital communicat.. (context) - Frey - 1998
114 Constraint networks - Dechter - 1992
113 Tractable inference for complex stochastic processes - Boyen, Koller - 1998
109 Efficient algorithms for combinatorial problems on graphs wi.. (context) - Arnborg - 1985
108 Approximating probabilistic inference in Bayesian belief net.. (context) - Dagum, Luby - 1993
95 Bucket elimination: A unifying framework for reasoning - Dechter - 1999
93 Reasoning about beliefs and actions under computational reso.. - Horvitz - 1987
85 Reasoning under varying and uncertain resource constraints - Horvitz - 1988
82 Near Shannon limit performance of low density parity check c.. - MacKay, Neal - 1996
82 Treewidth: Algorithmic techniques and results - Bodlaender - 1997
77 Nonserial Dynamic Programming (context) - Bertele, Brioschi - 1972
72 Turbo decoding as an instance of Pearl's belief propagation .. (context) - McEliece, MacKay et al. - 1997
61 Directional resolution: The Davis-Putnam procedure - Dechter, Rish - 1994
54 Bounded conditioning: flexible inference for decisions under.. (context) - Horvitz, Suermondt et al. - 1989
52 Introduction to Monte Carlo Methods (context) - MacKay - 1998
51 Theoretical Computer Science (context) - Dechter, van Beek et al. - 1997
45 A scheme for approximating probabilistic inference - Dechter, Rish - 1997
42 Computation and action under bounded resources (context) - Horvitz - 1990
32 Recursive algorithms for approximating probabilities in grap.. - Jaakkola, Jordan - 1996
31 A simple derivation of the coding theorem and some applicati.. (context) - Gallager - 1965
29 Approximations in Bayesian belief universes for knowledge-ba.. (context) - Jensen, Andersen - 1990
28 Probability functions on complex pedigrees (context) - Cannings, Thompson et al. - 1978
27 Near Shannon limit errorcorrecting coding: turbo codes (context) - Berrou, Glavieux et al. - 1993
25 Localized partial evaluation of belief networks - Draper - 1995
22 Diagnosing tree-decomposable circuits - Fattah, Dechter - 1995
21 Internist-1: An experimental computerbased diagnostic consul.. (context) - Miller, Pople - 1982
21 Mini-buckets: A general scheme for generating approximations.. - Dechter - 1997
20 Backtracking algorithms for constraint satisfaction problems - Dechter, Frost - 1997
19 A revolution: Belief propagation in graphs with cycles - Frey, MacKay - 1998
17 Reduction of computational complexity in Bayesian networks t.. - Kjaerulff - 1994
16 Bayesian networks for pattern classification (context) - Frey - 1997
16 Optimal decomposition of probabilistic networks by simulated.. (context) - Kjaerulff - 1992
14 On fourier's algorithm for linear constraints (context) - Lassez, Mahler - 1992
14 Stochastic local search for bayesian networks - Kask, Dechter - 1999
14 Constraint satisfaction - Dechter - 1998
13 Approximation algorithms for probabilistic decoding - Kask, Rish et al. - 1998
12 Causal independence for probability assessment and inference.. - Heckerman, Breese - 1995
12 Quick medical reference (context) - Miller, Masarie et al. - 1986
10 Preprocessing for triangulation of probabilistic networks - Bodlaender, Koster et al. - 2001
10 Bucket elimination: a unifying framework for processing hard.. - Dechter - 1997
10 Iterative decoding (context) - Cheng - 1997
9 New search heuristics for max-csp - Kask
8 Symbolic probabilistic inference large BNO network (context) - probabilistic, large et al. - 1994
6 Mini-bucket heuristics for improved search - Kask, Dechter - 1999
6 the optimal approximation of discrete functions with lowdime.. (context) - Montanari
6 Iterative join-graph propagation - Dechter, Kask et al. - 2002
5 the time complexity of bucket elimination algorithms - Larrosa - 2000
5 Tree approximation for belief updating - Mateescu, Dechter et al.
3 A survey on algorithms for real-time Bayesian network infere.. - Guo, Hsu - 2002
2 A general scheme for automatic search heuristics from specif.. (context) - Kask, Dechter - 2001
2 Bucket-tree elimination for automated reasoning - Kask, Dechter et al. - 2001
1 Triangulation of graph-based algorithms giving small total s.. (context) - Kjaerulff - 1990
Documents on the same site (http://www.ics.uci.edu/~dechter/publications/): More
Up and Down Mini-Buckets: A Scheme for Approximating.. - Kask, Larrosa, Dechter (2001) (Correct)
Mini-Buckets: A General Scheme for Approximating Inference - Dechter, Rish (1998) (Correct)
On the Time Complexity of Bucket Elimination Algorithms - Larrosa (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC