989 search results - page 76 / 198 » Classification and regression trees |
116
click to vote
ENDM
2010
15 years 4 months ago
2010
Deciding whether an arbitrary graph admits a VLSI layout with unit-length edges is NP-complete [1], even when restricted to binary trees [7]. However, for certain graphs, the prob...
130
Voted
CPC
2002
15 years 4 months ago
2002
The Wiener index is analyzed for random recursive trees and random binary search trees in the uniform probabilistic models. We obtain the expectations, asymptotics for the varianc...
153
Voted
ICCV
2007
IEEE
16 years 6 months ago
2007
IEEE
Discriminative methods for visual object category recognition are typically non-probabilistic, predicting class labels but not directly providing an estimate of uncertainty. Gauss...
138
click to vote
ICML
2004
IEEE
16 years 5 months ago
2004
IEEE
Traditional non-parametric statistical learning techniques are often computationally attractive, but lack the same generalization and model selection abilities as state-of-the-art...
139
click to vote
TSMC
2008
15 years 4 months ago
2008
In genetic programming (GP), evolving tree nodes separately would reduce the huge solution space. However, tree nodes are highly interdependent with respect to their fitness. In th...