The SCEAS System
Navigation Menu

Conferences in DBLP

Computational Learning Theory (COLT) (colt)
1998 (conf/colt/1998)

  1. Nicolò Cesa-Bianchi, Gábor Lugosi
    On Sequential Prediction of Individual Sequences Relative to a Set of Experts. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:1-11 [Conf]
  2. V. G. Vovk, Chris Watkins
    Universal Portfolio Selection. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:12-23 [Conf]
  3. Mark Herbster, Manfred K. Warmuth
    Tracking the Best Regressor. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:24-31 [Conf]
  4. Kenji Yamanishi
    Minimax Relative Loss Analysis for Sequential Prediction Algorithms Using Parametric Hypotheses. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:32-43 [Conf]
  5. John Case, Sanjay Jain, Matthias Ott, Arun Sharma, Frank Stephan
    Robust Learning Aided by Context. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:44-55 [Conf]
  6. Jochen Nessel
    Birds Can Fly. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:56-63 [Conf]
  7. Andrew R. Mitchell
    Learnability of a Subclass of Extended Pattern Languages. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:64-71 [Conf]
  8. Léa Meyer
    Aspects of Complexity of Conservative Probabilistic Learning. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:72-78 [Conf]
  9. Meir Feder
    Learning to Communicate via Unknown Channel (Abstract). [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:79- [Conf]
  10. Robert E. Schapire, Yoram Singer
    Improved Boosting Algorithms using Confidence-Rated Predictions. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:80-91 [Conf]
  11. Avrim Blum, Tom M. Mitchell
    Combining Labeled and Unlabeled Sata with Co-Training. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:92-100 [Conf]
  12. Stuart J. Russell
    Learning Agents for Uncertain Environments (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:101-103 [Conf]
  13. Claudio Gentile, David P. Helmbold
    Improved Lower Bounds for Learning from Noisy Examples: An Information-Theoretic Approach. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:104-115 [Conf]
  14. Philip M. Long
    The complexity of learning according to two models of a drifting environment. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:116-125 [Conf]
  15. Philip M. Long
    On the Sample Complexity of Learning Functions with Bounded Variation. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:126-133 [Conf]
  16. David Gamarnik
    Efficient Learning of Monotone Concepts via Quadratic Optimization. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:134-143 [Conf]
  17. Andreas Birkendorf, Norbert Klasner, Christian Kuhlmann, Hans-Ulrich Simon
    Structural Results about Exact Learning with Unspecified Attribute Values. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:144-153 [Conf]
  18. Roni Khardon
    Learning First Order Universal Horn Expressions. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:154-165 [Conf]
  19. Irene Tsapara, György Turán
    Learning Atomic Formulas with Prescribed Properties. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:166-174 [Conf]
  20. Thomas R. Amoth, Paul Cull, Prasad Tadepalli
    Exact Learning of Tree Patterns from Queries and Counterexamples. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:175-186 [Conf]
  21. Sanjay Jain, Carl H. Smith, Rolf Wiehagen
    On the Power of Learning Robustly. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:187-197 [Conf]
  22. Rüdiger Reischuk, Thomas Zeugmann
    Learning One-Variable Pattern Languages in Linear Average Time. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:198-208 [Conf]
  23. Yoav Freund, Robert E. Schapire
    Large Margin Classification Using the Perceptron Algorithm. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:209-217 [Conf]
  24. Martin Anthony, Sean B. Holden
    Cross-Validation for Binary Classification by Real-Valued Functions: Theoretical Analysis. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:218-229 [Conf]
  25. David A. McAllester
    Some PAC-Bayesian Theorems. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:230-234 [Conf]
  26. Matthias Miltrup, Georg Schnitger
    Neural Networks and Efficient Associative Memory. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:235-246 [Conf]
  27. Yoav Freund
    Self Bounding Learning Algorithms. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:247-258 [Conf]
  28. Christopher D. Rosin
    Sample Complexity of Model-Based Search. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:259-267 [Conf]
  29. Michael J. Kearns, Dana Ron
    Testing Problems with Sub-Learning Sample Complexity. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:268-279 [Conf]
  30. Baruch Awerbuch, Stephen G. Kobourov
    Polylogarithmic-Overhead Piecemeal Graph Exploration. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:280-286 [Conf]
  31. Leslie G. Valiant
    Projection Learning. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:287-293 [Conf]
  32. Amos Beimel, Felix Geller, Eyal Kushilevitz
    The Query Complexity of Finding Local Minima in the Lattice. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:294-302 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002