82 citations · 167 across the 5 of their papers we have counts for
5 papers
Random Algorithms for the Loop Cutset Problem
Ann Becker, Reuven Bar-Yehuada, Dan Geiger
We show how to find a minimum loop cutset in a Bayesian network with high probability. Finding such a loop cutset is the first step in Pearl's method of conditioning for inference.…
Approximation Algorithms for the Loop Cutset Problem
Ann Becker, Dan Geiger
We show how to find a small loop curser in a Bayesian network. Finding such a loop cutset is the first step in the method of conditioning for inference. Our algorithm for finding a…
A Sufficiently Fast Algorithm for Finding Close to Optimal Junction Trees
Ann Becker, Dan Geiger
An algorithm is developed for finding a close to optimal junction tree of a given graph G. The algorithm has a worst case complexity O(c^k n^a) where a and c are constants, n is th…
Perfect Tree-Like Markovian Distributions
Ann Becker, Dan Geiger, Christopher Meek
We show that if a strictly positive joint probability distribution for a set of binary random variables factors according to a tree, then vertex separation represents all and only…
Randomized Algorithms for the Loop Cutset Problem
R. Bar-Yehuda, A. Becker, D. Geiger
We show how to find a minimum weight loop cutset in a Bayesian network with high probability. Finding such a loop cutset is the first step in the method of conditioning for inferen…