| 2001 |
|---|
| 7 | EE | Ann Becker,
Dan Geiger:
A sufficiently fast algorithm for finding close to optimal clique trees.
Artif. Intell. 125(1-2): 3-17 (2001) |
| 2000 |
|---|
| 6 | EE | Ann Becker,
Dan Geiger,
Christopher Meek:
Perfect Tree-like Markovian Distributions.
UAI 2000: 19-23 |
| 5 | EE | Ann Becker,
Reuven Bar-Yehuda,
Dan Geiger:
Randomized Algorithms for the Loop Cutset Problem.
J. Artif. Intell. Res. (JAIR) 12: 219-234 (2000) |
| 1999 |
|---|
| 4 | EE | Ann Becker,
Reuven Bar-Yehuda,
Dan Geiger:
Random Algorithms for the Loop Cutset Problem.
UAI 1999: 49-56 |
| 1996 |
|---|
| 3 | EE | Ann Becker,
Dan Geiger:
A sufficiently fast algorithm for finding close to optimal junction trees.
UAI 1996: 81-89 |
| 2 | EE | Ann Becker,
Dan Geiger:
Optimization of Pearl's Method of Conditioning and Greedy-Like Approximation Algorithms for the Vertex Feedback Set Problem.
Artif. Intell. 83(1): 167-188 (1996) |
| 1994 |
|---|
| 1 | EE | Ann Becker,
Dan Geiger:
Approximation Algorithms for the Loop Cutset Problem.
UAI 1994: 60-68 |
