Volume 350,
Number 1,
18 January 2006
Algorithmic Learning Theory (ALT 2002)
- Nicolò Cesa-Bianchi, Rüdiger Reischuk, Thomas Zeugmann:
Foreword.
1-2
- Kazuyuki Amano, Akira Maruoka:
On learning monotone Boolean functions under the uniform distribution.
3-12
- Rocco A. Servedio:
On learning embedded midbit functions.
13-23
- Nader H. Bshouty, Lynn Burroughs:
Maximizing agreements and coagnostic learning.
24-39
- Jürgen Forster, Hans-Ulrich Simon:
On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes.
40-48
- Johannes Köbler, Wolfgang Lindner:
The complexity of learning concept classes with polynomial general dimension.
49-62
- Yusuke Suzuki, Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miyahara:
Ordered term tree languages which are polynomial time inductively inferable from positive data.
63-90
- Daniel Reidenbach:
A non-learnable class of E-pattern languages.
91-102
- Eric Martin, Arun Sharma, Frank Stephan:
Unifying logic, topology and learning in Parametric logic.
103-124
- Susumu Hayashi:
Mathematics based on incremental learning - Excluded middle and inductive inference.
125-139
- Bertram Fronhöfer, Akihiro Yamamoto:
Hypothesis finding with proof theoretical appropriateness criteria.
140-162
Volume 350,
Numbers 2-3,
7 February 2006
Automata,
Languages and Programming:
Logic and Semantics (ICALP-B 2004)
Copyright © Fri Mar 12 17:33:12 2010
by Michael Ley (ley@uni-trier.de)
