Ann Becker

	2011
8		Reuven Bar-Yehuda, Ann Becker, Dan Geiger: Randomized Algorithms for the Loop Cutset Problem CoRR abs/1106.0225: (2011)
	2001
7		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		Ann Becker, Dan Geiger, Christopher Meek: Perfect Tree-like Markovian Distributions. UAI 2000: 19-23
5		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		Ann Becker, Reuven Bar-Yehuda, Dan Geiger: Random Algorithms for the Loop Cutset Problem. UAI 1999: 49-56
	1996
3		Ann Becker, Dan Geiger: A sufficiently fast algorithm for finding close to optimal junction trees. UAI 1996: 81-89
2		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		Ann Becker, Dan Geiger: Approximation Algorithms for the Loop Cutset Problem. UAI 1994: 60-68

Coauthor Index

1	Reuven Bar-Yehuda	[4] [5] [8]
2	Dan Geiger	[1] [2] [3] [4] [5] [6] [7] [8]
3	Christopher Meek	[6]

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page