1422 search results - page 175 / 285 » Test Generation Algorithms Based on Preorder Relations |
130
click to vote
CIDM
2009
IEEE
15 years 10 months ago
2009
IEEE
— Both theory and a wealth of empirical studies have established that ensembles are more accurate than single predictive models. Unfortunately, the problem of how to maximize ens...
195
click to vote
CVPR
2012
IEEE
13 years 5 months ago
2012
IEEE
We address the problem of weakly supervised semantic segmentation. The training images are labeled only by the classes they contain, not by their location in the image. On test im...
127
click to vote
AUSAI
2005
Springer
15 years 9 months ago
2005
Springer
: In order to scale to problems with large or continuous state-spaces, reinforcement learning algorithms need to be combined with function approximation techniques. The majority of...
121
Voted
WABI
2005
Springer
15 years 8 months ago
2005
Springer
We give a new algorithm for the genotype phasing problem. Our solution is based on a hidden Markov model for haplotypes. The model has a uniform structure, unlike most solutions pr...
108
click to vote
ICCAD
2001
IEEE
16 years 8 days ago
2001
IEEE
SPFDs are a mechanism to express flexibility in Boolean networks. Introduced by Yamashita et al. in the context of FPGA synthesis [4], they were extended later to general combina...