399 search results - page 45 / 80 » Robust Boosting for Learning from Few Examples |
149
Voted
ICML
2000
IEEE
16 years 3 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...
133
Voted
CHES
2011
Springer
14 years 2 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...
134
Voted
CVPR
2007
IEEE
16 years 4 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...
126
click to vote
CVPR
2007
IEEE
16 years 4 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...
198
Voted
AH
2008
Springer
15 years 9 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...