9888 search results - page 299 / 1978 » Active Algorithm Selection |
134
click to vote
JMLR
2010
14 years 10 months ago
2010
L1 (also referred to as the 1-norm or Lasso) penalty based formulations have been shown to be effective in problem domains when noisy features are present. However, the L1 penalty...
142
click to vote
ALT
2004
Springer
16 years 22 days ago
2004
Springer
The decomposition method is currently one of the major methods for solving the convex quadratic optimization problems being associated with support vector machines. For a special c...
161
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
We present a novel framework for recognizing repetitive
sequential events performed by human actors with strong
temporal dependencies and potential parallel overlap. Our
solutio...
138
click to vote
ICIP
2006
IEEE
16 years 5 months ago
2006
IEEE
In this paper, we propose to combine formally noise and shape priors in region-based active contours. On the one hand, we use the general framework of exponential family as a prio...
138
click to vote
ICIP
2001
IEEE
16 years 5 months ago
2001
IEEE
The paper presents several novel 3D image analysis algorithms, applied towards the segmentation and modeling of faces and hands. These are subsequently used to build a face-based ...