<--- Back to Details
First PageDocument Content
Theoretical computer science / Mathematics / Learning theory / Inductive inference / Algorithmic learning theory / Nicolò Cesa-Bianchi / Algorithm / Learnability / Probably approximately correct learning / Computational learning theory / Machine learning / Applied mathematics
Date: 2014-03-14 14:22:29
Theoretical computer science
Mathematics
Learning theory
Inductive inference
Algorithmic learning theory
Nicolò Cesa-Bianchi
Algorithm
Learnability
Probably approximately correct learning
Computational learning theory
Machine learning
Applied mathematics

doi:j.tcs

Add to Reading List

Source URL: www-alg.ist.hokudai.ac.jp

Download Document from Source Website

File Size: 105,43 KB

Share Document on Facebook

Similar Documents

The learnability of Business Rules Olivier Wang1,2 , Changhai Ke1 , Leo Liberti2 , Christian de Sainte Marie1 1 2 IBM France, 9 Rue de Verdun, 94250 Gentilly, France

DocID: 1vdD4 - View Document

Human Effort and Machine Learnability in Computer Aided Translation Spence Green, Sida Wang, Jason Chuang,* Jeffrey Heer,* Sebastian Schuster, and Christopher D. Manning Computer Science Department, Stanford University {

DocID: 1tbbe - View Document

Littlestone’s Dimension and Online Learnability Shai Shalev-Shwartz Toyota Technological Institute at Chicago ⇒ The Hebrew University Talk at UCSD workshop, February, 2009 Joint work with Shai Ben-David and David Pa

DocID: 1taEO - View Document

The learnability of Auditory Center-embedded Recursion Jun Lai () Tilburg Center for Logic, Ethics and Philosophy of Science; Tilburg Center for Cognition and Communication, Tilburg University,

DocID: 1t7At - View Document

Case, Word Order, and Language Learnability: Insights from Connectionist Modeling Gary Lupyan () Morten H. Christiansen () Department of Psychology Cornell University

DocID: 1sv5J - View Document