224 search results - page 27 / 45 » Bounding Learning Time in XCS |
FOCS
1999
IEEE
14 years 23 days ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
ICCV
2011
IEEE
12 years 8 months ago
2011
IEEE
We propose a framework for large scale learning and annotation of structured models. The system interleaves interactive labeling (where the current model is used to semiautomate t...
ICS
2010
Tsinghua U.
14 years 17 days ago
2010
Tsinghua U.
: We study the weight distribution and list-decoding size of Reed-Muller codes. Given a weight parameter, we are interested in bounding the number of Reed-Muller codewords with a w...
JMLR
2010
13 years 3 months ago
2010
Imitation Learning, while applied successfully on many large real-world problems, is typically addressed as a standard supervised learning problem, where it is assumed the trainin...
JALC
2007
13 years 8 months ago
2007
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...