 | 2008 |
|---|
| 9 |       | Pradeep D. Ravikumar,
Alekh Agarwal,
Martin J. Wainwright:
Message-passing for graph-structured linear programs: proximal projections, convergence and rounding schemes.
ICML 2008: 800-807 |
| 2007 |
|---|
| 8 | | Pradeep D. Ravikumar,
Han Liu,
John D. Lafferty,
Larry A. Wasserman:
SpAM: Sparse Additive Models.
NIPS 2007 |
| 2006 |
|---|
| 7 | | Pradeep D. Ravikumar,
John D. Lafferty:
Quadratic programming relaxations for metric labeling and Markov random field MAP estimation.
ICML 2006: 737-744 |
| 6 | | Martin J. Wainwright,
Pradeep D. Ravikumar,
John D. Lafferty:
High-Dimensional Graphical Model Selection Using $\ell_1$-Regularized Logistic Regression.
NIPS 2006: 1465-1472 |
| 2005 |
|---|
| 5 | | Pradeep D. Ravikumar,
John D. Lafferty:
Preconditioner Approximations for Probabilistic Graphical Models.
NIPS 2005 |
| 2004 |
|---|
| 4 | | Pradeep D. Ravikumar,
William W. Cohen:
A Hierarchical Graphical Model for Record Linkage.
UAI 2004: 454-461 |
| 3 | | Pradeep D. Ravikumar,
John D. Lafferty:
Variational Chernoff Bounds for Graphical Models.
UAI 2004: 462-469 |
| 2003 |
|---|
| 2 | | William W. Cohen,
Pradeep D. Ravikumar,
Stephen E. Fienberg:
A Comparison of String Distance Metrics for Name-Matching Tasks.
IIWeb 2003: 73-78 |
| 1 | | Mikhail Bilenko,
Raymond J. Mooney,
William W. Cohen,
Pradeep D. Ravikumar,
Stephen E. Fienberg:
Adaptive Name Matching in Information Integration.
IEEE Intelligent Systems 18(5): 16-23 (2003) |
