dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Arthur Choi Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArthur Choi, Khaled S. Refaat, Adnan Darwiche: EDML: A Method for Learning Parameters in Bayesian Networks CoRR abs/1202.3709: (2012)
2011
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArthur Choi, Khaled S. Refaat, Adnan Darwiche: EDML: A Method for Learning Parameters in Bayesian Networks. UAI 2011: 115-124
2010
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArthur Choi, Adnan Darwiche: Relax, Compensate and Then Recover. JSAI-isAI Workshops 2010: 167-180
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan He, Arthur Choi, Knot Pipatsrisawat, Adnan Darwiche, Eleazar Eskin: Optimal algorithms for haplotype assembly from whole-genome sequence data. Bioinformatics [ISMB] 26(12): 183-190 (2010)
2009
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArthur Choi, Trevor Standley, Adnan Darwiche: Approximating Weighted Max-SAT Problems by Compensating for Relaxations. CP 2009: 211-225
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArthur Choi, Adnan Darwiche: Approximating MAP by Compensating for Structural Relaxations. NIPS 2009: 351-359
2008
9no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArthur Choi, Adnan Darwiche: Focusing Generalizations of Belief Propagation on Targeted Queries. AAAI 2008: 1024-1030
8no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArthur Choi, Adnan Darwiche: Many-Pairs Mutual Information for Adding Structure to Belief Propagation Approximations. AAAI 2008: 1031-1036
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArthur Choi, Adnan Darwiche: Approximating the Partition Function by Deleting and then Correcting for Model Edges. UAI 2008: 79-87
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArthur Choi, Noah Zaitlen, Buhm Han, Knot Pipatsrisawat, Adnan Darwiche, Eleazar Eskin: Efficient Genome Wide Tagging by Reduction to SAT. WABI 2008: 135-147
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKnot Pipatsrisawat, Akop Palyan, Mark Chavira, Arthur Choi, Adnan Darwiche: Solving Weighted Max-SAT Problems in a Reduced Search Space: A Performance Analysis. JSAT 4(2-4): 191-217 (2008)
2007
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArthur Choi, Mark Chavira, Adnan Darwiche: Node Splitting: A Scheme for Generating Upper Bounds in Bayesian Networks. UAI 2007: 57-66
2006
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArthur Choi, Adnan Darwiche: An Edge Deletion Semantics for Belief Propagation and its Practical Impact on Approximation Quality. AAAI 2006: 1107-1114
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArthur Choi, Adnan Darwiche: A Variational Approach for Approximating Bayesian Networks by Edge Deletion. UAI 2006
2005
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAdnan Darwiche, Hei Chan, Arthur Choi: On Bayesian Network Approximation by Edge Deletion. UAI 2005: 128-135

Coauthor Index

1Hei Chan [1]
2Mark Chavira [4] [5]
3Adnan Darwiche [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15]
4Eleazar Eskin [6] [12]
5Buhm Han [6]
6Dan He [12]
7Akop Palyan [5]
8Knot Pipatsrisawat [5] [6] [12]
9Khaled S. Refaat [14] [15]
10Trevor Scott Standley (Trevor Standley) [11]
11Noah Zaitlen [6]

Last update Tue May 29 01:28:40 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page