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

9783642044137, 9783642044144

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Uncountable Automatic Classes and Learning

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-642-04414-4_25 ◽

2009 ◽

pp. 293-307 ◽

Cited By ~ 2

Author(s):

Sanjay Jain ◽

Qinglong Luo ◽

Pavel Semukhin ◽

Frank Stephan

Download Full-text

Pure Exploration in Multi-armed Bandits Problems

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-642-04414-4_7 ◽

2009 ◽

pp. 23-37 ◽

Cited By ~ 49

Author(s):

Sébastien Bubeck ◽

Rémi Munos ◽

Gilles Stoltz

Download Full-text

Approximation Algorithms for Tensor Clustering

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-642-04414-4_30 ◽

2009 ◽

pp. 368-383 ◽

Cited By ~ 17

Author(s):

Stefanie Jegelka ◽

Suvrit Sra ◽

Arindam Banerjee

Keyword(s):

Approximation Algorithms

Download Full-text

Difficulties in Forcing Fairness of Polynomial Time Inductive Inference

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-642-04414-4_23 ◽

2009 ◽

pp. 263-277 ◽

Cited By ~ 6

Author(s):

John Case ◽

Timo Kötzing

Keyword(s):

Polynomial Time ◽

Inductive Inference

Download Full-text

Learning Unknown Graphs

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-642-04414-4_13 ◽

2009 ◽

pp. 110-125 ◽

Cited By ~ 1

Author(s):

Nicolò Cesa-Bianchi ◽

Claudio Gentile ◽

Fabio Vitale

Download Full-text

Reconstructing Weighted Graphs with Minimal Query Complexity

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-642-04414-4_12 ◽

2009 ◽

pp. 97-109 ◽

Cited By ~ 3

Author(s):

Nader H. Bshouty ◽

Hanna Mazzawi

Keyword(s):

Query Complexity ◽

Weighted Graphs

Download Full-text

Computable Bayesian Compression for Uniformly Discretizable Statistical Models

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-642-04414-4_9 ◽

2009 ◽

pp. 53-67

Author(s):

Łukasz Dębowski

Keyword(s):

Statistical Models

Download Full-text

Canonical Horn Representations and Query Learning

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-642-04414-4_16 ◽

2009 ◽

pp. 156-170 ◽

Cited By ~ 3

Author(s):

Marta Arias ◽

José L. Balcázar

Keyword(s):

Query Learning

Download Full-text

Complexity versus Agreement for Many Views

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-642-04414-4_21 ◽

2009 ◽

pp. 232-246 ◽

Cited By ~ 3

Author(s):

Odalric-Ambrym Maillard ◽

Nicolas Vayatis

Download Full-text

Completing Networks Using Observed Data

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-642-04414-4_14 ◽

2009 ◽

pp. 126-140 ◽

Cited By ~ 9

Author(s):

Tatsuya Akutsu ◽

Takeyuki Tamura ◽

Katsuhisa Horimoto

Download Full-text

Lecture Notes in Computer Science - Algorithmic Learning TheoryLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Uncountable Automatic Classes and Learning

Pure Exploration in Multi-armed Bandits Problems

Approximation Algorithms for Tensor Clustering

Difficulties in Forcing Fairness of Polynomial Time Inductive Inference

Learning Unknown Graphs

Reconstructing Weighted Graphs with Minimal Query Complexity

Computable Bayesian Compression for Uniformly Discretizable Statistical Models

Canonical Horn Representations and Query Learning

Complexity versus Agreement for Many Views

Completing Networks Using Observed Data

Lecture Notes in Computer Science - Algorithmic Learning Theory
Latest Publications