3. EuroCOLT 1997:
Jerusalem, Israel
Shai Ben-David (Ed.):
Computational Learning Theory, Third European Conference, EuroCOLT '97, Jerusalem, Israel, March 17-19, 1997, Proceedings.
Lecture Notes in Computer Science 1208 Springer 1997, ISBN 3-540-62685-9
- Manfred K. Warmuth:
Sample Compression, Learnability, and the Vapnik-Chervonenkis Dimension.
1-2

- Amos Beimel, Eyal Kushilevitz:
Learning Boxes in High Dimension.
3-15

- David Guijarro, Víctor Lavín, Vijay Raghavan:
Learning Monotone Term Decision Lists.
16-26

- Nader H. Bshouty, Christino Tamon, David K. Wilson:
Learning Matrix Functions over Rings.
27-37

- Robert H. Sloan, György Turán:
Learning from Incomplete Boundary Queries Using Split Graphs and Hypergraphs.
38-50

- Joel Ratsaby, Vitaly Maiorov:
Generalization of the PAC-Model for Learning with Partial Information.
51-65

- Léa Meyer:
Monotonic and Dual-Monotonic Probabilistic Language Learning of Indexed Families with High Probability.
66-78

- Juris Smotrovs:
Closedness Properties in Team Learning of Recursive Functions.
79-93

- Matthias Ott, Frank Stephan:
Structural Measures for Games and Process Control in the Branch Learning Model.
94-108

- Yoav Freund, Yishay Mansour:
Learning Under Persistent Drift.
109-118

- Nicolò Cesa-Bianchi, Paul Fischer, Eli Shamir, Hans-Ulrich Simon:
Randomized Hypotheses and Minimum Disagreement Hypotheses for Learning with Noise.
119-133

- David P. Helmbold, Stephen Kwek, Leonard Pitt:
Learning When to Trust Which Experts.
134-149

- Francesco Bergadano, Nader H. Bshouty, Christino Tamon, Stefano Varricchio:
On Learning Programs and Small Depth Circuits.
150-161

- Jorge Castro, David Guijarro, Víctor Lavín:
Learning Nearly Monotone k-term DNF.
162-170

- Ryuhei Uehara, Kensei Tsuchida, Ingo Wegener:
Optimal Attribute-Efficient Learning of Disjunction, Parity and Threshold Functions.
171-184

- Satoshi Matsumoto, Ayumi Shinohara:
Learning Pattern Languages Using Queries.
185-197

- Andreas Birkendorf:
On Fast and Simple Algorithms for Finding Maximal Subarrays and Applications in Learning Theory.
198-209

- Peter L. Bartlett, Tamás Linder, Gábor Lugosi:
A Minimax Lower Bound for Empirical Quantizer Design.
210-222

- Pascal Koiran, Eduardo D. Sontag:
Vapnik-Chervonenkis Dimension of Recurrent Neural Networks.
223-237

- Leonid Gurvits:
Linear Algebraic Proofs of VC-Dimension Based Inequalities.
238-250

- Jonathan Baxter, Peter L. Bartlett:
A Result Relating Convex n-Widths to Covering Numbers with some Applications to Neural Networks.
251-259

- John Shawe-Taylor:
Confidence Estimates of Classification Accuracy on New Examples.
260-271

- Janis Barzdins, Rusins Freivalds, Carl H. Smith:
Learning Formulae from Elementary Facts.
272-285

- John Case, Sanjay Jain, Mandayam Suraj:
Control Structures in Hypothesis Spaces: The Influence on Learning.
286-300

- Andris Ambainis, Sanjay Jain, Arun Sharma:
Ordinal Mind Change Complexity of Language Identification.
301-315

- Susanne Kaufmann, Frank Stephan:
Robust Learning with Infinite Additional Information.
316-330

Last update Wed May 22 20:31:37 2013
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page