157 search results - page 27 / 32 » On Bayesian bounds |
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
Planning how to interact against bounded memory and unbounded memory learning opponents needs different treatment. Thus far, however, work in this area has shown how to design pla...
GPEM
2008
13 years 8 months ago
2008
Efficiency enhancement techniques--such as parallelization and hybridization--are among the most important ingredients of practical applications of genetic and evolutionary algori...
BMCBI
2007
13 years 8 months ago
2007
Over the last two decades a large number of algorithms has been developed for regulatory motif finding. Here we show how many of these algorithms, especially those that model bind...
CVPR
2006
IEEE
14 years 10 months ago
2006
IEEE
In order to work well, many computer vision algorithms require that their parameters be adjusted according to the image noise level, making it an important quantity to estimate. W...
ICCV
2007
IEEE
14 years 10 months ago
2007
IEEE
We extend the "Sparse LDA" algorithm of [7] with new sparsity bounds on 2-class separability and efficient partitioned matrix inverse techniques leading to 1000-fold spe...