16 search results - page 2 / 4 » Linear Binary Space Partitions and the Hierarchy of Object C... |
DATAMINE
1999
13 years 7 months ago
1999
To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields t...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
We propose an algorithm for function approximation that evolves a set of hierarchical piece-wise linear regressors. The algorithm, named HIRE-Lin, follows the iterative rule learn...
WAE
1998
13 years 8 months ago
1998
In recent years realistic input models for geometric algorithms have been studied. The most important models introduced are fatness, low density, unclutteredness, and small simple...
ICPR
2006
IEEE
14 years 8 months ago
2006
IEEE
Viola and Jones (VJ) cascade classification methods have proven to be very successful in detecting objects belonging to a single class -- e.g., faces. This paper addresses the mor...
MP
2002
13 years 7 months ago
2002
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...