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