Dean P. Foster

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2011
27Stochastic convex optimization with bandit feedback. Alekh Agarwal, Dean P. Foster, Daniel Hsu, Sham M. Kakade, Alexander Rakhlin. CoRR (abs/1107.1744) (2011). Web SearchBibTeXDownload
26No Internal Regret via Neighborhood Watch. Dean P. Foster, Alexander Rakhlin. CoRR (abs/1108.6088) (2011). Web SearchBibTeXDownload
25Domain Adaptation: Overfitting and Small Sample Statistics. Dean P. Foster, Sham M. Kakade, Ruslan Salakhutdinov. CoRR (abs/1105.0857) (2011). Web SearchBibTeXDownload
24Minimum Description Length Penalization for Group and Multi-Task Sparse Learning. Paramveer S. Dhillon, Dean P. Foster, Lyle H. Ungar. Journal of Machine Learning Research (12): 525-564 (2011). Web SearchBibTeXDownload
23Domain Adaptation with Coupled Subspaces. John Blitzer, Sham Kakade, Dean P. Foster. Journal of Machine Learning Research - Proceedings Track (15): 173-181 (2011). Web SearchBibTeXDownload
22Complexity-Based Approach to Calibration with Checking Rules. Dean P. Foster, Alexander Rakhlin, Karthik Sridharan, Ambuj Tewari. Journal of Machine Learning Research - Proceedings Track (19): 293-314 (2011). Web SearchBibTeXDownload
2010
21A New Approach to Lexical Disambiguation of Arabic Text. Rushin Shah, Paramveer S. Dhillon, Mark Liberman, Dean P. Foster, Mohamed Maamouri, Lyle H. Ungar. EMNLP 2010, 725-735. Web SearchBibTeXDownload
20Feature Selection using Multiple Streams. Paramveer S. Dhillon, Dean P. Foster, Lyle H. Ungar. Journal of Machine Learning Research - Proceedings Track (9): 153-160 (2010). Web SearchBibTeXDownload
2009
19Transfer Learning Using Feature Selection. Paramveer S. Dhillon, Dean P. Foster, Lyle H. Ungar. CoRR (abs/0905.4022) (2009). Web SearchBibTeXDownload
18Multi-task Feature Selection Using the Multiple Inclusion Criterion (MIC). Paramveer S. Dhillon, Brian Tomasik, Dean P. Foster, Lyle H. Ungar. ECML/PKDD (1) 2009, 276-289. Web SearchBibTeXDownload
17VIF Regression: A Fast Regression Algorithm for Large Data. Dongyu Lin, Dean P. Foster. ICDM 2009, 848-853. Web SearchBibTeXDownload
16Brain Imaging and Brain Privacy: A Realistic Concern?. Martha J. Farah, M. Elizabeth Smith, Cyrena Gawuga, Dennis Lindsell, Dean P. Foster. J. Cognitive Neuroscience (21): 119-127 (2009). Web SearchBibTeXDownload
2008
15Efficient Feature Selection in the Presence of Multiple Feature Classes. Paramveer S. Dhillon, Dean P. Foster, Lyle H. Ungar. ICDM 2008, 779-784. Web SearchBibTeXDownload
14Information Consistency of Nonparametric Gaussian Process Methods. Matthias W. Seeger, Sham M. Kakade, Dean P. Foster. IEEE Transactions on Information Theory (54): 2376-2382 (2008). Web SearchBibTeXDownload
13Deterministic calibration and Nash equilibrium. Sham M. Kakade, Dean P. Foster. J. Comput. Syst. Sci. (74): 115-130 (2008). Web SearchBibTeXDownload
2007
12Multi-view Regression Via Canonical Correlation Analysis. Sham M. Kakade, Dean P. Foster. COLT 2007, 82-96. Web SearchBibTeXDownload
2006
11Streamwise Feature Selection. Jing Zhou, Dean P. Foster, Robert A. Stine, Lyle H. Ungar. Journal of Machine Learning Research (7): 1861-1885 (2006). Web SearchBibTeXDownload
2005
10Streaming feature selection using alpha-investing. Jing Zhou, Dean P. Foster, Robert A. Stine, Lyle H. Ungar. KDD 2005, 384-393. Web SearchBibTeXDownload
9Worst-Case Bounds for Gaussian Process Models. Sham M. Kakade, Matthias Seeger, Dean P. Foster. NIPS 2005. Web SearchBibTeXDownload
2004
8Deterministic Calibration and Nash Equilibrium. Sham Kakade, Dean P. Foster. COLT 2004, 33-48. Web SearchBibTeXDownload
2002
7Universal codes for finite sequences of integers drawn from a monotone distribution. Dean P. Foster, Robert A. Stine, Abraham J. Wyner. IEEE Transactions on Information Theory (48): 1713-1720 (2002). Web SearchBibTeXDownload
1999
6Local Asymptotic Coding and the Minimum Description Length. Dean P. Foster, Robert A. Stine. IEEE Transactions on Information Theory (45): 1289-1293 (1999). Web SearchBibTeXDownload
1998
5Accounting for Cognitive Costs in On-Line Auction Design. David C. Parkes, Lyle H. Ungar, Dean P. Foster. AMET 1998, 25-40. Web SearchBibTeXDownload
4Competitive Algorithms for Layered Graph Traversal. Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan. SIAM J. Comput. (28): 447-462 (1998). Web SearchBibTeXDownload
1997
3Characterizing the generalization performance of model selection strategies. Dale Schuurmans, Lyle H. Ungar, Dean P. Foster. ICML 1997, 340-348. Web SearchBibTeX
1991
2Competitive Algorithms for Layered Graph Traversal. Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan. FOCS 1991, 288-297. Web SearchBibTeXDownload
1989
1Probabilistic Analysis of a Heuristics for the Dual Bin Packing Problem. Dean P. Foster, Rakesh Vohra. Inf. Process. Lett. (31): 287-290 (1989). Web SearchBibTeXDownload
from DBLP and Google Scholar
References
1. ^ KDD 2005 - draft program: Aug 21-24, Chicago, IL. USA - Retrieved 2011-06-19 - details
2. ^ Computer Science Colloquium - NYU Computer Science Department - Retrieved 2011-04-23 - details
3. ^ Scaling eScience Impact - Retrieved 2010-12-09 - details
Developed by the Database Group at the University of Wisconsin and Yahoo! Research