The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Rusins Freivalds
    Inductive Inference of Minimal Programs. [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:3-22 [Conf]
  2. Thomas R. Hancock
    Identifying µ-Formula Decision Trees with Queries. [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:23-37 [Conf]
  3. Vijay Raghavan, Stephen R. Schach
    Learning Switch Configurations. [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:38-51 [Conf]
  4. Naoki Abe, Manfred K. Warmuth
    On the Computational Complexity of Approximating Distributions by Probabilistic Automata. [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:52-66 [Conf]
  5. Kenji Yamanishi
    A Learning Criterion for Stochastic Rules. [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:67-81 [Conf]
  6. Ker-I Ko
    On the Complexity of Learning Minimum Time-Bounded Turing Machines. [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:82-96 [Conf]
  7. Takeshi Shinohara
    Inductive Inference from Positive Data is Powerful. [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:97-110 [Conf]
  8. Keith Wright
    Inductive Identification of Pattern Languages Restricted Substitutions. [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:111-121 [Conf]
  9. Robert E. Schapire
    Pattern Languages are not Learnable. [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:122-129 [Conf]
  10. Paul Fischer, Hans-Ulrich Simon
    On Learning Ring-Sum-Expansions. [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:130-143 [Conf]
  11. Avrim Blum, Mona Singh
    Learning Functions of k Terms. [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:144-153 [Conf]
  12. Bonnie Eisenberg, Ronald L. Rivest
    On the Sample Complexity of PAC-Learning Using Random and Chosen Examples. [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:154-162 [Conf]
  13. Sanjay Jain, Arun Sharma
    Finite Learning by a ``Team''. [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:163-177 [Conf]
  14. Efim B. Kinber
    Some Problems of Learning with an Oracle. [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:178-186 [Conf]
  15. Daniel N. Osherson, Michael Stob, Scott Weinstein
    A Mechanical Method of Successful Scientific Inquiry. [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:187-201 [Conf]
  16. Yoav Freund
    Boosting a Weak Learning Algorithm by Majority. [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:202-216 [Conf]
  17. Sally A. Goldman, Michael J. Kearns, Robert E. Schapire
    On the Sample Complexity of Weak Learning. [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:217-231 [Conf]
  18. Shai Ben-David, Alon Itai, Eyal Kushilevitz
    Learning by Distances. [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:232-245 [Conf]
  19. Martin Anthony, Norman Biggs, John Shawe-Taylor
    The Learnability of Formal Concepts. [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:246-257 [Conf]
  20. Eric B. Baum
    Polynomial Time Algorithms for Learning Neural Nets. [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:258-272 [Conf]
  21. Philip M. Long, Manfred K. Warmuth
    Composite Geometric Concepts and Polynomial Predictability. [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:273-287 [Conf]
  22. David P. Helmbold, Robert H. Sloan, Manfred K. Warmuth
    Learning Integer Lattices. [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:288-302 [Conf]
  23. Hans-Ulrich Simon
    On the Number of Examples and Stages Needed for Learning Decision Trees. [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:303-313 [Conf]
  24. Karsten A. Verbeurgt
    Learning DNF Under the Uniform Distribution in Quasi-Polynomial Time. [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:314-326 [Conf]
  25. Efim B. Kinber, William I. Gasarch, Thomas Zeugmann, Mark G. Pleszkoch, Carl H. Smith
    Learning Via Queries With Teams and Anomilies. [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:327-337 [Conf]
  26. William I. Gasarch, Mark G. Pleszkoch, Robert Solovay
    Learning Via Queries in [+, <]. [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:338-351 [Conf]
  27. Pekka Orponen, Russell Greiner
    On the Sample Complexity of Finding Good Search Strategies. [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:352-358 [Conf]
  28. Javed A. Aslam, Ronald L. Rivest
    Inferring Graphs from Walks. [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:359-370 [Conf]
  29. V. G. Vovk
    Aggregating Strategies. [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:371-386 [Conf]
  30. Dana Angluin, Michael Frazier, Leonard Pitt
    Learning Conjunctions of Horn Clauses (Abstract). [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:387- [Conf]
  31. Sally A. Goldman, Michael J. Kearns, Robert E. Schapire
    Exact Identification of Circuits Using Fixed Points of Amplification Functions (Abstract). [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:388- [Conf]
  32. Michael J. Kearns, Robert E. Schapire
    Efficient Distribution-Free Learning of Probabilistic Concepts (Abstract). [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:389- [Conf]
  33. Ramamohan Paturi, Michael E. Saks
    On Threshold Circuits for Parity (Abstract). [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:390- [Conf]
  34. Wolfgang Maass, György Turán
    On the Complexity of Learning from Counterexamples and Membership Queries (abstract). [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:391- [Conf]
  35. Mark A. Fulk
    Robust Separations in Inductive Inference (Abstract). [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:392- [Conf]
  36. Avrim Blum
    Separating PAC and Mistake-Bound Learning Models Over the Boolean Domain (Abstract). [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:393- [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