60 search results - page 2 / 12 » Boosting versus Covering |
COLT
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We present several results related to ranking. We give a general margin-based bound for ranking based on the L∞ covering number of the hypothesis space. Our bound sugge...
PAMI
2012
11 years 7 months ago
2012
—The problem of automatic and optimal design of embedded object detector cascades is considered. Two main challenges are identified: optimization of the cascade configuration and...
DATE
2007
IEEE
13 years 11 months ago
2007
IEEE
Multi-core architectures introduce a new granularity at which process variations may occur, yielding asymmetry among cores that were designed—and that software expects—to be s...
TCSV
2008
13 years 5 months ago
2008
Conventional subspace learning or recent feature extraction methods consider globality as the key criterion to design discriminative algorithms for image classification. We demonst...
CVPR
2006
IEEE
14 years 7 months ago
2006
IEEE
A fundamental challenge in face recognition lies in determining what facial features are important for the identification of faces. In this paper, a novel face recognition framewo...