263 search results - page 16 / 53 » Splitting of Learnable Classes |
IJCM
2007
13 years 8 months ago
2007
We present splitting methods for numerically solving a certain class of explicitly time-dependent linear differential equations. Starting from an efficient method for the autonom...
ICML
2003
IEEE
14 years 9 months ago
2003
IEEE
This paper proposes a novel decision tree for a data set with time-series attributes. Our time-series tree has a value (i.e. a time sequence) of a time-series attribute in its int...
ICGI
2010
Springer
13 years 9 months ago
2010
Springer
Angluin showed that the class of regular languages could be learned from a Minimally Adequate Teacher (mat) providing membership and equivalence queries. Clark and Eyraud (2007) sh...
ISAAC
2007
Springer
14 years 2 months ago
2007
Springer
In an edge deletion problem one is asked to delete at most k edges from a given graph such that the resulting graph satisfies a certain property. In this work, we study four NP-co...
ICML
1990
IEEE
14 years 20 days ago
1990
IEEE
Decision trees that are limited to testing a single variable at a node are potentially much larger than trees that allow testing multiple variables at a node. This limitation redu...