450 search results - page 26 / 90 » Estimating Search Tree Size |
AAAI
2012
11 years 11 months ago
2012
This paper concerns learning and prediction with probabilistic models where the domain sizes of latent variables have no a priori upper-bound. Current approaches represent prior d...
ICRA
2008
IEEE
14 years 3 months ago
2008
IEEE
— We present heuristic algorithms for pruning large sets of candidate paths or trajectories down to smaller subsets that maintain desirable characteristics in terms of overall re...
BMVC
1998
13 years 10 months ago
1998
In this paper a colour object search algorithm is presented. Given an image, areas of interest are generated (for each database model) by isolating regions whose colours are simil...
ICML
1990
IEEE
14 years 28 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...
KDD
2007
ACM
14 years 9 months ago
2007
ACM
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...