176 search results - page 3 / 36 » The complexity of properly learning simple concept classes |
TCS
2010
13 years 3 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
ALT
2010
Springer
13 years 5 months ago
2010
Springer
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...
COLT
1991
Springer
13 years 8 months ago
1991
Springer
While most theoretical work in machine learning has focused on the complexity of learning, recently there has been increasing interest in formally studying the complexity of teach...
COLT
1993
Springer
13 years 9 months ago
1993
Springer
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
IEEEPACT
2005
IEEE
13 years 11 months ago
2005
IEEE
The continual demand for greater performance and growing concerns about the power consumption in highperformance microprocessors make the branch predictor a critical component of ...