The SCEAS System
| |||||||

## Search the dblp DataBase
Nick Littlestone:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Nick Littlestone
**Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm (Extended Abstract)**[Citation Graph (1, 0)][DBLP] FOCS, 1987, pp:68-77 [Conf] - Avrim Blum, Lisa Hellerstein, Nick Littlestone
**Learning in the Presence of Finitely or Infinitely Many Irrelevant Attributes.**[Citation Graph (0, 0)][DBLP] COLT, 1991, pp:157-166 [Conf] - Claudio Gentile, Nick Littlestone
**The Robustness of the**[Citation Graph (0, 0)][DBLP]*p*-Norm Algorithms. COLT, 1999, pp:1-11 [Conf] - Adam J. Grove, Nick Littlestone, Dale Schuurmans
**General Convergence Results for Linear Discriminant Updates.**[Citation Graph (0, 0)][DBLP] COLT, 1997, pp:171-183 [Conf] - David Haussler, Michael J. Kearns, Nick Littlestone, Manfred K. Warmuth
**Equivalence of Models for Polynomial Learnability.**[Citation Graph (0, 0)][DBLP] COLT, 1988, pp:42-55 [Conf] - David Haussler, Nick Littlestone, Manfred K. Warmuth
**Predicting {0, 1}-Functions on Randomly Drawn Points.**[Citation Graph (0, 0)][DBLP] COLT, 1988, pp:280-296 [Conf] - Nick Littlestone
**From On-Line to Batch Learning.**[Citation Graph (0, 0)][DBLP] COLT, 1989, pp:269-284 [Conf] - Nick Littlestone
**Redundant Noisy Attributes, Attribute Errors, and Linear-Threshold Learning Using Winnow.**[Citation Graph (0, 0)][DBLP] COLT, 1991, pp:147-156 [Conf] - Nick Littlestone, Philip M. Long
**On-Line Learning with Linear Loss Constraints.**[Citation Graph (0, 0)][DBLP] COLT, 1993, pp:412-421 [Conf] - David P. Helmbold, Nick Littlestone, Philip M. Long
**Apple Tasting and Nearly One-Sided Learning**[Citation Graph (0, 0)][DBLP] FOCS, 1992, pp:493-502 [Conf] - David Haussler, Nick Littlestone, Manfred K. Warmuth
**Predicting {0,1}-Functions on Randomly Drawn Points (Extended Abstract)**[Citation Graph (0, 0)][DBLP] FOCS, 1988, pp:100-109 [Conf] - Nick Littlestone, Manfred K. Warmuth
**The Weighted Majority Algorithm**[Citation Graph (0, 0)][DBLP] FOCS, 1989, pp:256-261 [Conf] - Nick Littlestone
**Comparing Several Linear-threshold Learning Algorithms on Tasks Involving Superfluous Attributes.**[Citation Graph (0, 0)][DBLP] ICML, 1995, pp:353-361 [Conf] - Nick Littlestone, Chris Mesterharm
**An Apobayesian Relative of Winnow.**[Citation Graph (0, 0)][DBLP] NIPS, 1996, pp:204-210 [Conf] - Nick Littlestone, Philip M. Long, Manfred K. Warmuth
**On-Line Learning of Linear Functions**[Citation Graph (0, 0)][DBLP] STOC, 1991, pp:465-475 [Conf] - Nick Littlestone, Philip M. Long, Manfred K. Warmuth
**On-line Learning of Linear Functions.**[Citation Graph (0, 0)][DBLP] Computational Complexity, 1995, v:5, n:1, pp:1-23 [Journal] - David Haussler, Michael J. Kearns, Nick Littlestone, Manfred K. Warmuth
**Equivalence of Models for Polynomial Learnability**[Citation Graph (0, 0)][DBLP] Inf. Comput., 1991, v:95, n:2, pp:129-161 [Journal] - David Haussler, Nick Littlestone, Manfred K. Warmuth
**Predicting \0,1\-Functions on Randomly Drawn Points**[Citation Graph (0, 0)][DBLP] Inf. Comput., 1994, v:115, n:2, pp:248-292 [Journal] - David P. Helmbold, Nick Littlestone, Philip M. Long
**Apple Tasting.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 2000, v:161, n:2, pp:85-139 [Journal] - David P. Helmbold, Nick Littlestone, Philip M. Long
**On-Line Learning with Linear Loss Constraints.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 2000, v:161, n:2, pp:140-171 [Journal] - Nick Littlestone, Manfred K. Warmuth
**The Weighted Majority Algorithm**[Citation Graph (0, 0)][DBLP] Inf. Comput., 1994, v:108, n:2, pp:212-261 [Journal] - Avrim Blum, Lisa Hellerstein, Nick Littlestone
**Learning in the Presence of Finitely or Infinitely Many Irrelevant Attributes.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1995, v:50, n:1, pp:32-40 [Journal] - Adam J. Grove, Nick Littlestone, Dale Schuurmans
**General Convergence Results for Linear Discriminant Updates.**[Citation Graph (0, 0)][DBLP] Machine Learning, 2001, v:43, n:3, pp:173-210 [Journal] - Nick Littlestone
**Learning Quickly When Irrelevant Attributes Abound: A New Linear-threshold Algorithm.**[Citation Graph (0, 0)][DBLP] Machine Learning, 1987, v:2, n:4, pp:285-318 [Journal] **Learning faster than promised by the Vapnik-Chervonenkis dimension.**[Citation Graph (, )][DBLP]
Search in 0.020secs, Finished in 0.021secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |