Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

58

Voted

JCSS
2008

favoriteEmaildiscussreport

70views more JCSS 2008»

The complexity of properly learning simple concept classes

15 years 17 days ago

The complexity of properly learning simple concept classes

Download www.eecs.harvard.edu

Michael Alekhnovich, Mark Braverman, Vitaly Feldma

Real-time Traffic

JCSS 2008 |

claim paper

Related Content

» On the proper learning of axis parallel concepts

» The Complexity of Learning Concept Classes with Polynomial General Dimension

» Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples

» Bounds on the Sample Complexity for Private Learning and Private Data Release

» Surrogate regret bounds for proper losses

» Learning DFA from Simple Examples

» Bayesian Methods for Support Vector Machines Evidence and Predictive Class Probabilities

» Instancebased concept learning from multiclass DNA microarray data

» Loopfree alternates and notvia addresses A proper combination for IP fast reroute

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2008
Where	JCSS
Authors	Michael Alekhnovich, Mark Braverman, Vitaly Feldman, Adam R. Klivans, Toniann Pitassi

Comments (0)