263 search results - page 16 / 53 » Splitting of Learnable Classes |
144
click to vote
IJCM
2007
15 years 6 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...
155
click to vote
ICML
2003
IEEE
16 years 7 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...
161
click to vote
ICGI
2010
Springer
15 years 7 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...
147
click to vote
ISAAC
2007
Springer
16 years 18 days 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...
160
click to vote
ICML
1990
IEEE
15 years 10 months 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...