Lecture Notes in Computer Science - Algorithmic Learning Theory
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540635772, 9783540696025

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Learning DFA from simple examples

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/3-540-63577-7_39 ◽

1997 ◽

pp. 116-131 ◽

Cited By ~ 9

Author(s):

Rajesh Parekh ◽

Vasant Honavar

Download Full-text

Learning disjunctions of features

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/3-540-63577-7_57 ◽

1997 ◽

pp. 401-415

Author(s):

Stephen Kwe

Download Full-text

Monotone extensions of boolean data sets

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/3-540-63577-7_42 ◽

1997 ◽

pp. 161-175 ◽

Cited By ~ 2

Author(s):

Endre Borosl ◽

Toshihide Ibaraki ◽

Kazuhisa Makino

Keyword(s):

Data Sets

Download Full-text

Inferability of recursive real-valued functions

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/3-540-63577-7_33 ◽

1997 ◽

pp. 18-31 ◽

Cited By ~ 5

Author(s):

Eiju Hirowatari ◽

Setsuo Arikawa

Download Full-text

Program error detection/correction: Turning PAC learning into Perfect learning

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/3-540-63577-7_31 ◽

1997 ◽

pp. 1-1

Author(s):

Manuel Blum

Keyword(s):

Error Detection ◽

Pac Learning ◽

Program Error

Download Full-text

On the relevance of time in neural computation and learning

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/3-540-63577-7_55 ◽

1997 ◽

pp. 364-384 ◽

Cited By ~ 2

Author(s):

Wolfgang Maass

Keyword(s):

Neural Computation

Download Full-text

Learning and revising theories in noisy domains

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/3-540-63577-7_53 ◽

1997 ◽

pp. 339-351 ◽

Cited By ~ 1

Author(s):

Xiaolong Rang ◽

Masayuki Numao

Keyword(s):

Noisy Domains

Download Full-text

Effects of Kolmogorov complexity present in inductive inference as well

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/3-540-63577-7_47 ◽

1997 ◽

pp. 244-259 ◽

Cited By ~ 2

Author(s):

Andris Ambainis ◽

Kalvis Apsītis ◽

Cristian Calude ◽

Rūsiņš Freivalds ◽

Marek Karpinski ◽

...

Keyword(s):

Kolmogorov Complexity ◽

Inductive Inference

Download Full-text

Derandomized learning of boolean functions

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/3-540-63577-7_38 ◽

1997 ◽

pp. 100-115

Author(s):

Meera Sitharam ◽

Timothy Straney

Keyword(s):

Boolean Functions

Download Full-text

Exact learning via teaching assistants (Extended abstract)

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/3-540-63577-7_50 ◽

1997 ◽

pp. 291-306

Author(s):

V. Arvind ◽

N. V. Vinodchandran

Keyword(s):

Teaching Assistants ◽

Exact Learning

Download Full-text

Lecture Notes in Computer Science - Algorithmic Learning TheoryLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Learning DFA from simple examples

Learning disjunctions of features

Monotone extensions of boolean data sets

Inferability of recursive real-valued functions

Program error detection/correction: Turning PAC learning into Perfect learning

On the relevance of time in neural computation and learning

Learning and revising theories in noisy domains

Effects of Kolmogorov complexity present in inductive inference as well

Derandomized learning of boolean functions

Exact learning via teaching assistants (Extended abstract)

Lecture Notes in Computer Science - Algorithmic Learning Theory
Latest Publications