Algorithmic Learning Theory
for ALT 2006 in
Theoretical Computer Science
Algorithmic Learning Theoryfor ALT 2006 in Theoretical Computer Science |
|
|
appeared as:
The Special Issue on Algorithmic Learning Theory (ALT 2006) has been edited by Phil Long and Frank Stephan. |
|
Phil Long
and
Frank Stephan.
Preface, | pp. 207-208 |
|
|
|
|
Alp Atıcı
and
Rocco A. Servedio.
Learning unions of ω(1)-dimensional rectangles, Abstract. | pp. 209-222 |
|
|
|
|
Leonid (Aryeh) Kontorovich,
Corinna Cortes,
and
Mehryar Mohri.
Kernel methods for learning languages, Abstract. | pp. 223-236 |
|
|
|
|
Andreas Maurer.
Unsupervised slow subspace-learning from stationary processes, Abstract. | pp. 237-255 |
|
|
|
|
Jan Poland
Consistency of discrete Bayesian learning, Abstract. | pp. 256-273 |
|
|
|
|
Daniil Ryabko
and
Marcus Hutter.
On the possibility of learning in reactive environments with arbitrary dependence, Abstract. | pp. 274-284 |
|
|
|
|
Vladimir Vovk.
Leading strategies in competitive on-line prediction, Abstract. | pp. 285-296 |
|
|
|
 back to the ALT
Archives page
|
