Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
116
Voted
COLT
2005
Springer
113
views
Machine Learning
»
more
COLT 2005
»
Unlabeled Compression Schemes for Maximum Classes,
15 years 8 months ago
Download
machinelearning.pbworks.com
We give a compression scheme for any maximum class of VC dimension d that compresses any sample consistent with a concept in the class to at most d unlabeled points from the domain of the sample.
Dima Kuzmin, Manfred K. Warmuth
Real-time Traffic
COLT 2005
|
Compression Scheme
|
VC Dimension
|
claim paper
Related Content
»
Recursive Teaching Dimension Learning Complexity and Maximum Classes
»
Learning NoReference Quality Metric by Examples
»
Speeding up algorithms on compressed web graphs
more »
Post Info
More Details (n/a)
Added
26 Jun 2010
Updated
26 Jun 2010
Type
Conference
Year
2005
Where
COLT
Authors
Dima Kuzmin, Manfred K. Warmuth
Comments
(0)
Researcher Info
Machine Learning Study Group
Computer Vision