4095 search results - page 343 / 819 » How to test a tree |
142
click to vote
ENTCS
2010
15 years 2 months ago
2010
d Set Abstraction using SAT Edd Barrett Andy King School of Computing, University of Kent, CT2 7NF, UK Symbolic decision trees are not the only way to correlate the relationship b...
165
click to vote
CORR
2011
Springer
15 years 17 days ago
2011
Springer
We answer a problem posed in [GKM08] regarding a restricted model of small-space computation, tailored for solving the GEN problem. They define two variants of “incremental bra...
120
click to vote
ENTCS
2011
15 years 16 days ago
2011
d abstract) Andr´e Joyal 1 D´epartement des math´ematiques Universit´e du Qu´ebec `a Montr´eal Canada Joachim Kock 2 3 Departament de matem`atiques Universitat Aut`onoma de B...
150
click to vote
CORR
2010
Springer
15 years 15 days ago
2010
Springer
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
265
Voted
SADM
2011
15 years 15 days ago
2011
: Minimal depth is a dimensionless order statistic that measures the predictiveness of a variable in a survival tree. It can be used to select variables in high-dimensional problem...