Special Issue on
Algorithmic Learning Theory
for ALT '93 in
Theoretical Computer Science Vol. 137, No. 1, January 9, 1995.
Special Issue on
Algorithmic Learning Theoryfor ALT '93 in Theoretical Computer Science Vol. 137, No. 1, January 9, 1995. |
|
The Special Issue on Algorithmic Learning Theory for ALT'93 in Theoretical Computer Science has been edited by S. Arikawa, S. Miyano, and T. Yokomori.
|
S. Arikawa, S. Miyano, and T. Yokomori.
Preface, | pp. 1 |
|
|
|
|
Masami Hagiya.
A typed λ-calculus for proving-by-example and bottom-up generalization procedure, | pp. 3-23 |
|
|
|
|
Klaus P. Jantke and Steffen Lange.
Case-based representation and learning of pattern languages, | pp. 25-51 |
|
|
|
|
Yasuhito Mukouchi and Setsuo Arikawa.
Towards a mathematical theory of machine discovery from facts, | pp. 53-84 |
|
|
|
|
Sanjay Jain and Arun Sharma.
On aggregating teams of learning machines, | pp. 85-108 |
|
|
|
|
Akito Sakurai.
On the VC-dimension of depth four threshold circuits and the complexity of Boolean-valued functions, | pp. 109-127 |
|
|
|
|
Ayumi Shinohara.
Complexity of computing Vapnik-Chervonenkis dimension and some generalized dimensions, | pp. 129-144 |
|
|
|
|
Susumu Hasegawa, Hiroshi Imai, and Masaki Ishiguro.
ε-approximations of k-label spaces, | pp. 145-157 |
|
|
|
|
Atsuyoshi Nakamura and Naoki Abe.
Exact learning of linear combinations of monotone terms from function value queries, | pp. 159-176 |
|
|
|
 back to the ALT
Archives page
|
