4. EuroCOLT 1999: Nordkirchen, Germany

@proceedings{DBLP:conf/eurocolt/1999,
  editor    = {Paul Fischer and
               Hans-Ulrich Simon},
  title     = {Computational Learning Theory, 4th European Conference, EuroCOLT
               '99, Nordkirchen, Germany, March 29-31, 1999, Proceedings},
  booktitle = {EuroCOLT},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1572},
  year      = {1999},
  isbn      = {3-540-65701-0},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Lectures

• Robert E. Schapire:
  Theoretical Views of Boosting. 1-10
  Electronic Edition (Springer LINK) BibTeX
• Richard S. Sutton:
  Open Theoretical Questions in Reinforcement Learning. 11-17
  Electronic Edition (Springer LINK) BibTeX

Learning from Random Examples

• Nigel Duffy, David P. Helmbold:
  A Geometric Approach to Leveraging Weak Learners. 18-33
  Electronic Edition (Springer LINK) BibTeX
• Ran Bachrach, Shai Fine, Eli Shamir:
  Query by Committee, Linear Separation and Random Walks. 34-49
  Electronic Edition (Springer LINK) BibTeX
• Peter L. Bartlett, Shai Ben-David:
  Hardness Results for Neural Network Approximation Problems. 50-62
  Electronic Edition (Springer LINK) BibTeX

Learning from Queries and Counterexamples

• Víctor Dalmau, Peter Jeavons:
  Learnability of Quantified Formulas. 63-78
  Electronic Edition (Springer LINK) BibTeX
• Jürgen Forster:
  Learning Multiplicity Automata from Smallest Counterexamples. 79-90
  Electronic Edition (Springer LINK) BibTeX
• David Guijarro, Víctor Lavín, Vijay Raghavan:
  Exact Learning when Irrelevant Variables Abound. 91-100
  Electronic Edition (Springer LINK) BibTeX
• Thomas Hofmeister:
  An Application of Codes to Attribute-Efficient Learning. 101-110
  Electronic Edition (Springer LINK) BibTeX
• Roni Khardon:
  Learning Range Restricted Horn Expressions. 111-125
  Electronic Edition (Springer LINK) BibTeX

Reinforcement Learning

• Vladislav Tadic:
  On the Asymptotic Behaviour of a Constant Stepsize Temporal-Difference Learning Algorithm. 126-137
  Electronic Edition (Springer LINK) BibTeX

On-line Learning and Expert Advice

• David P. Helmbold, Sandra Panizza, Manfred K. Warmuth:
  Direct and Indirect Algorithms for On-line Learning of Disjunctions. 138-152
  Electronic Edition (Springer LINK) BibTeX
• Jyrki Kivinen, Manfred K. Warmuth:
  Averaging Expert Predictions. 153-167
  Electronic Edition (Springer LINK) BibTeX

Teaching and Learning

• Christian Kuhlmann:
  On Teaching and Learning Intersection-Closed Concept Classes. 168-182
  Electronic Edition (Springer LINK) BibTeX

Inductive Inference

• Matthias Ott, Frank Stephan:
  Avoiding Coding Tricks by Hyperrobust Learning. 183-197
  Electronic Edition (Springer LINK) BibTeX
• Sanjay Jain, Arun Sharma:
  Mind Change Complexity of Learning Logic Programs. 198-213
  Electronic Edition (Springer LINK) BibTeX

Statistical Theory of Learning and Pattern Recognition

• Alex J. Smola, Robert C. Williamson, Sebastian Mika, Bernhard Schölkopf:
  Regularized Principal Manifolds. 214-229
  Electronic Edition (Springer LINK) BibTeX
• Nicolas Vayatis, Robert Azencott:
  Distribution-Dependent Vapnik-Chervonenkis Bounds. 230-240
  Electronic Edition (Springer LINK) BibTeX
• András Antos:
  Lower Bounds on the Rate of Convergence of Nonparametric Pattern Recognition. 241-252
  Electronic Edition (Springer LINK) BibTeX
• Márta Horváth:
  On Error Estimation for the Partitioning Classification Rule. 253-262
  Electronic Edition (Springer LINK) BibTeX
• John Shawe-Taylor, Nello Cristianini:
  Margin Distribution Bounds on Generalization. 263-273
  Electronic Edition (Springer LINK) BibTeX
• John Shawe-Taylor, Nello Cristianini:
  Generalization Performance of Classifiers in Terms of Observed Covering Numbers. 274-284
  Electronic Edition (Springer LINK) BibTeX
• Robert C. Williamson, Alex J. Smola, Bernhard Schölkopf:
  Entropy Numbers, Operators and Support Vector Kernels. 285-299
  Electronic Edition (Springer LINK) BibTeX