| 2008 |
| 14 | EE | Matthias W. Seeger,
Sham M. Kakade,
Dean P. Foster:
Information Consistency of Nonparametric Gaussian Process Methods.
IEEE Transactions on Information Theory 54(5): 2376-2382 (2008) |
| 13 | EE | Sham M. Kakade,
Dean P. Foster:
Deterministic calibration and Nash equilibrium.
J. Comput. Syst. Sci. 74(1): 115-130 (2008) |
| 2007 |
| 12 | EE | Sham M. Kakade,
Dean P. Foster:
Multi-view Regression Via Canonical Correlation Analysis.
COLT 2007: 82-96 |
| 2006 |
| 11 | EE | Jing Zhou,
Dean P. Foster,
Robert A. Stine,
Lyle H. Ungar:
Streamwise Feature Selection.
Journal of Machine Learning Research 7: 1861-1885 (2006) |
| 2005 |
| 10 | EE | Jing Zhou,
Dean P. Foster,
Robert A. Stine,
Lyle H. Ungar:
Streaming feature selection using alpha-investing.
KDD 2005: 384-393 |
| 9 | EE | Sham M. Kakade,
Matthias Seeger,
Dean P. Foster:
Worst-Case Bounds for Gaussian Process Models.
NIPS 2005 |
| 2004 |
| 8 | EE | Sham Kakade,
Dean P. Foster:
Deterministic Calibration and Nash Equilibrium.
COLT 2004: 33-48 |
| 2002 |
| 7 | | Dean P. Foster,
Robert A. Stine,
Abraham J. Wyner:
Universal codes for finite sequences of integers drawn from a monotone distribution.
IEEE Transactions on Information Theory 48(6): 1713-1720 (2002) |
| 1999 |
| 6 | | Dean P. Foster,
Robert A. Stine:
Local Asymptotic Coding and the Minimum Description Length.
IEEE Transactions on Information Theory 45(4): 1289-1293 (1999) |
| 1998 |
| 5 | EE | David C. Parkes,
Lyle H. Ungar,
Dean P. Foster:
Accounting for Cognitive Costs in On-Line Auction Design.
AMET 1998: 25-40 |
| 4 | | Amos Fiat,
Dean P. Foster,
Howard J. Karloff,
Yuval Rabani,
Yiftach Ravid,
Sundar Vishwanathan:
Competitive Algorithms for Layered Graph Traversal.
SIAM J. Comput. 28(2): 447-462 (1998) |
| 1997 |
| 3 | | Dale Schuurmans,
Lyle H. Ungar,
Dean P. Foster:
Characterizing the generalization performance of model selection strategies.
ICML 1997: 340-348 |
| 1991 |
| 2 | | Amos Fiat,
Dean P. Foster,
Howard J. Karloff,
Yuval Rabani,
Yiftach Ravid,
Sundar Vishwanathan:
Competitive Algorithms for Layered Graph Traversal
FOCS 1991: 288-297 |
| 1989 |
| 1 | | Dean P. Foster,
Rakesh Vohra:
Probabilistic Analysis of a Heuristics for the Dual Bin Packing Problem.
Inf. Process. Lett. 31(6): 287-290 (1989) |