Sciweavers

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

108

Voted

COLT
1998
Springer

84views Machine Learning» more COLT 1998»

Testing Problems with Sub-Learning Sample Complexity

15 years 7 months ago

Testing Problems with Sub-Learning Sample Complexity

Download www.eng.tau.ac.il

Michael J. Kearns, Dana Ron

Real-time Traffic

COLT 1998 | Machine Learning |

claim paper

Related Content

» SpaceEfficient Estimation of Robust Statistics and Distribution Testing

» External Sampling

» Distributed SamplingBased Roadmap of Trees for LargeScale Motion Planning

» Quantum Algorithms for Testing Properties of Distributions

» Network bucket testing

» A String of Feature Graphs Model for Recognition of Complex Activities in Natural Videos

» On bounding the delay of a critical path

» Sublinear algorithms for testing monotone and unimodal distributions

» Optimal reconstruction might be hard

Post Info
More Details (n/a)

Added	05 Aug 2010
Updated	05 Aug 2010
Type	Conference
Year	1998
Where	COLT
Authors	Michael J. Kearns, Dana Ron

Comments (0)