Algorithmic Learning Theory
for ALT '99 in
Theoretical Computer Science
Algorithmic Learning Theoryfor ALT '99 in Theoretical Computer Science |
|
|
Theoretical Computer Science
Volume 288, Issue 2, September 2002.
The Special Issue on Algorithmic Learning Theory for ALT '99 has been edited by Osamu Watanabe and Arun Sharma. |
|
Osamu Watanabe and
Arun
Sharma.
Preface, |
pp. 195 - 196. |
|
|
|
|
José L. Balcázar,
Jorge Castro,
David Guijarro
and
Hans-Ulrich Simon
The Consistency Dimension and Distribution-Dependendent Learning from Queries, Abstract. | pp. 197 - 215 |
|
|
|
|
Eiji Takimoto and
Manfred K. Warmuth
Predicting Nearly as Well as the Best Pruning of a Planar Decision Graph, Abstract. | pp. 217 - 235 |
|
|
|
|
Sally A. Goldman and
Stephen S. Kwek
On Learning Unions of Pattern Languages and Tree Patterns in the Mistake Bound Model, Abstract. | pp. 237 - 254 |
|
|
|
|
Nader H. Bshouty,
Nadav Eiron and
Eyal Kushilevitz
PAC Learning with Nasty Noise, Abstract. | pp. 255 - 275 |
|
|
|
|
Steffen Lange and
Gunter Grieser
On the Power of Incremental Learning, Abstract. | pp. 277 - 307 |
|
|
|
|
Frank Stephan and
Thomas Zeugmann
Learning Classes of Approximations to Non-Recursive Functions, Abstract. | pp. 309 - 341 |
|
|
|
 back to the ALT
Archives page
|
