Search the dblp DataBase
Ann Becker: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Ann Becker, Dan Geiger, Christopher Meek
Perfect Tree-like Markovian Distributions. [Citation Graph (0, 0)][DBLP]
UAI, 2000, pp:19-23 [Conf] - Ann Becker, Reuven Bar-Yehuda, Dan Geiger
Random Algorithms for the Loop Cutset Problem. [Citation Graph (0, 0)][DBLP]
UAI, 1999, pp:49-56 [Conf] - Ann Becker, Dan Geiger
Approximation Algorithms for the Loop Cutset Problem. [Citation Graph (0, 0)][DBLP]
UAI, 1994, pp:60-68 [Conf] - Ann Becker, Dan Geiger
A sufficiently fast algorithm for finding close to optimal junction trees. [Citation Graph (0, 0)][DBLP]
UAI, 1996, pp:81-89 [Conf] - Ann Becker, Dan Geiger
A sufficiently fast algorithm for finding close to optimal clique trees. [Citation Graph (0, 0)][DBLP]
Artif. Intell., 2001, v:125, n:1-2, pp:3-17 [Journal] - Ann Becker, Dan Geiger
Optimization of Pearl's Method of Conditioning and Greedy-Like Approximation Algorithms for the Vertex Feedback Set Problem. [Citation Graph (0, 0)][DBLP]
Artif. Intell., 1996, v:83, n:1, pp:167-188 [Journal] - Ann Becker, Reuven Bar-Yehuda, Dan Geiger
Randomized Algorithms for the Loop Cutset Problem. [Citation Graph (0, 0)][DBLP]
J. Artif. Intell. Res. (JAIR), 2000, v:12, n:, pp:219-234 [Journal]
Search in 0.001secs, Finished in 0.001secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002