Learning Theory - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540222828, 9783540278191

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Learning a Hidden Graph Using O(log n) Queries Per Edge

Learning Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-540-27819-1_15 ◽

2004 ◽

pp. 210-223 ◽

Cited By ~ 9

Author(s):

Dana Angluin ◽

Jiang Chen

Polynomial Time Prediction Strategy with Almost Optimal Mistake Probability

Learning Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-540-27819-1_5 ◽

2004 ◽

pp. 64-76

Author(s):

Nader H. Bshouty

Keyword(s):

Polynomial Time ◽

Time Prediction ◽

Prediction Strategy

Learning Over Compact Metric Spaces

Learning Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-540-27819-1_17 ◽

2004 ◽

pp. 239-254 ◽

Cited By ~ 3

Author(s):

H. Quang Minh ◽

Thomas Hofmann

Keyword(s):

Metric Spaces ◽

Compact Metric Spaces

An Improved VC Dimension Bound for Sparse Polynomials

Learning Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-540-27819-1_27 ◽

2004 ◽

pp. 393-407

Author(s):

Michael Schmitt

Keyword(s):

Vc Dimension ◽

Sparse Polynomials

On the Convergence of MDL Density Estimation

Learning Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-540-27819-1_22 ◽

2004 ◽

pp. 315-330 ◽

Cited By ~ 5

Author(s):

Tong Zhang

Keyword(s):

Density Estimation

Regret Bounds for Hierarchical Classification with Linear-Threshold Functions

Learning Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-540-27819-1_7 ◽

2004 ◽

pp. 93-108 ◽

Cited By ~ 6

Author(s):

Nicolò Cesa-Bianchi ◽

Alex Conconi ◽

Claudio Gentile

Keyword(s):

Hierarchical Classification ◽

Threshold Functions ◽

Linear Threshold Functions ◽

Linear Threshold ◽

Regret Bounds

The Budgeted Multi-armed Bandit Problem

Learning Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-540-27819-1_46 ◽

2004 ◽

pp. 643-645 ◽

Cited By ~ 10

Author(s):

Omid Madani ◽

Daniel J. Lizotte ◽

Russell Greiner

Keyword(s):

Bandit Problem

Learning Classes of Probabilistic Automata

Learning Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-540-27819-1_9 ◽

2004 ◽

pp. 124-139 ◽

Cited By ~ 8

Author(s):

François Denis ◽

Yann Esposito

Keyword(s):

Probabilistic Automata

A Framework for Statistical Clustering with a Constant Time Approximation Algorithms for K-Median Clustering

Learning Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-540-27819-1_29 ◽

2004 ◽

pp. 415-426 ◽

Cited By ~ 3

Author(s):

Shai Ben-David

Keyword(s):

Approximation Algorithms ◽

Constant Time ◽

Time Approximation ◽

Statistical Clustering

A Statistical Mechanics Analysis of Gram Matrix Eigenvalue Spectra

Learning Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-540-27819-1_40 ◽

2004 ◽

pp. 579-593 ◽

Cited By ~ 1

Author(s):

David C. Hoyle ◽

Magnus Rattray

Keyword(s):

Statistical Mechanics ◽

Gram Matrix ◽

Matrix Eigenvalue ◽

Mechanics Analysis

Learning Theory - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Learning a Hidden Graph Using O(log n) Queries Per Edge

Polynomial Time Prediction Strategy with Almost Optimal Mistake Probability

Learning Over Compact Metric Spaces

An Improved VC Dimension Bound for Sparse Polynomials

On the Convergence of MDL Density Estimation

Regret Bounds for Hierarchical Classification with Linear-Threshold Functions

The Budgeted Multi-armed Bandit Problem

Learning Classes of Probabilistic Automata

A Framework for Statistical Clustering with a Constant Time Approximation Algorithms for K-Median Clustering

A Statistical Mechanics Analysis of Gram Matrix Eigenvalue Spectra

Learning Theory - Lecture Notes in Computer Science
Latest Publications