Sciweavers

4 search results - page 1 / 1
» Unlabeled Compression Schemes for Maximum Classes,
Sort
View
COLT
2005
Springer
13 years 10 months ago
Unlabeled Compression Schemes for Maximum Classes,
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...
Dima Kuzmin, Manfred K. Warmuth
ALT
2010
Springer
13 years 4 months ago
Recursive Teaching Dimension, Learning Complexity, and Maximum Classes
This paper is concerned with the combinatorial structure of concept classes that can be learned from a small number of examples. We show that the recently introduced notion of recu...
Thorsten Doliwa, Hans-Ulrich Simon, Sandra Zilles
MMM
2005
Springer
152views Multimedia» more  MMM 2005»
13 years 10 months ago
Learning No-Reference Quality Metric by Examples
In this paper, a novel learning based method is proposed for No-Reference image quality assessment. Instead of examining the exact prior knowledge for the given type of distortion...
Hanghang Tong, Mingjing Li, HongJiang Zhang, Chang...
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
13 years 11 months ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen