| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. John Langford Luis von Ahn , Manuel Blum , John Langford: Telling humans and computers apart automatically. Commun. ACM 47 (2): 56-60 (2004) Sham Kakade , Michael J. Kearns , John Langford, Luis E. Ortiz : Correlated equilibria in graphical games. ACM Conference on Electronic Commerce 2003 : 42-47 Avrim Blum , John Langford: PAC-MDL Bounds. COLT 2003 : 344-357 Luis von Ahn , Manuel Blum , Nicholas J. Hopper , John Langford: CAPTCHA: Using Hard AI Problems for Security. EUROCRYPT 2003 : 294-311 Bianca Zadrozny , John Langford, Naoki Abe : Cost-Sensitive Learning by Cost-Proportionate Example Weighting. ICDM 2003 : 435- Sham Kakade , Michael J. Kearns , John Langford: Exploration in Metric State Spaces. ICML 2003 : 306-312 John Langford, Avrim Blum : Microchoice Bounds and Self Bounding Learning Algorithms. Machine Learning 51 (2): 165-179 (2003) Nicholas J. Hopper , John Langford, Luis von Ahn : Provably Secure Steganography. CRYPTO 2002 : 77-92 Sham Kakade , John Langford: Approximately Optimal Approximate Reinforcement Learning. ICML 2002 : 267-274 John Langford: Combining Trainig Set and Test Set Bounds. ICML 2002 : 331-338 John Langford, Martin Zinkevich , Sham Kakade : Competitive Analysis of the Explore/Exploit Tradeoff. ICML 2002 : 339-346 John Langford, Matthias Seeger , Nimrod Megiddo : An Improved Predictive Accuracy Bound for Averaging Classifiers. ICML 2001 : 290-297 John Langford, Rich Caruana : (Not) Bounding the True Error. NIPS 2001 : 809-816 Sebastian Thrun , John Langford, Vandi Verma : Risk Sensitive Particle Filters. NIPS 2001 : 961-968 John Langford, David A. McAllester : Computable Shell Decomposition Bounds. COLT 2000 : 25-34 Joseph O'Sullivan , John Langford, Rich Caruana , Avrim Blum : FeatureBoost: A Meta-Learning Algorithm that Improves Model Robustness. ICML 2000 : 703-710 Avrim Blum , Adam Kalai , John Langford: Beating the Hold-Out: Bounds for K-fold and Progressive Cross-Validation. COLT 1999 : 203-208 John Langford, Avrim Blum : Microchoice Bounds and Self Bounding Learning Algorithms. COLT 1999 : 209-214 Avrim Blum , John Langford: Probabilistic Planning in the Graphplan Framework. ECP 1999 : 319-332 Sebastian Thrun , John Langford, Dieter Fox : Monte Carlo Hidden Markov Models: Learning Non-Parametric Models of Partially Observable Stochastic Processes. ICML 1999 : 415-424 Avrim Blum , Carl Burch , John Langford: On Learning Monotone Boolean Functions. FOCS 1998 : 408-415 1 [ 17 ] 2 [ 14 ] [ 18 ] [ 21 ] 3 [ 1 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 15 ] [ 19 ] 4 [ 18 ] [ 21 ] 5 [ 1 ] 6 [ 6 ] [ 9 ] 7 [ 2 ] 8 [ 14 ] [ 18 ] 9 [ 11 ] [ 13 ] [ 16 ] [ 20 ] 10 [ 5 ] 11 [ 16 ] [ 20 ] 12 [ 7 ] 13 [ 10 ] 14 [ 6 ] 15 [ 20 ] 16 [ 10 ] 17 [ 2 ] [ 8 ] 18 [ 8 ] 19 [ 17 ] 20 [ 11 ]  ©2004 Association for Computing Machinery |
