1405 search results - page 183 / 281 » Anytime Algorithm for Feature Selection |
JMLR
2000
14 years 11 months ago
2000
This paper describes the mixtures-of-trees model, a probabilistic model for discrete multidimensional domains. Mixtures-of-trees generalize the probabilistic trees of Chow and Liu...
136
click to vote
ML
1998
ACM
14 years 11 months ago
1998
ACM
To operate successfully in indoor environments, mobile robots must be able to localize themselves. Most current localization algorithms lack flexibility, autonomy, and often optim...
115
click to vote
SODA
2010
ACM
14 years 10 months ago
2010
ACM
The partial sums problem in succinct data structures asks to preprocess an array A[1 . . n] of bits into a data structure using as close to n bits as possible, and answer queries ...
102
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
The Prague texture segmentation data-generator and benchmark is a web based (http://mosaic.utia.cas.cz) service designed to mutually compare and rank different texture segmenters,...
112
click to vote
ICMCS
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper, we propose an effective coarse-to-fine algorithm to detect text in video. Firstly, in coarse-detection section, stroke filter is employed to detect all candidate st...