399 search results - page 45 / 80 » Robust Boosting for Learning from Few Examples |
111
click to vote
ICML
2000
IEEE
15 years 10 months ago
2000
IEEE
Eligibility traces have been shown to speed reinforcement learning, to make it more robust to hidden states, and to provide a link between Monte Carlo and temporal-difference meth...
CHES
2011
Springer
13 years 9 months ago
2011
Springer
A lightweight and secure key storage scheme using silicon Physical Unclonable Functions (PUFs) is described. To derive stable PUF bits from chip manufacturing variations, a lightwe...
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
The existing methods for offline training of cascade classifiers take a greedy search to optimize individual classifiers in the cascade, leading inefficient overall performance. W...
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
Our goal is to circumvent one of the roadblocks to using existing approaches for single-view recognition for achieving multi-view recognition, namely, the need for sufficient trai...
149
click to vote
AH
2008
Springer
15 years 4 months ago
2008
Springer
As new interactive systems evolve, they frequently hit a sweet spot: A few new tricks to learn, and users gets tremendous benefits, simplifying their lives. But beyond that lies t...