1118 search results - page 17 / 224 » Convex Optimization |
151
click to vote
NIPS
2008
15 years 5 months ago
2008
Recently, supervised dimensionality reduction has been gaining attention, owing to the realization that data labels are often available and indicate important underlying structure...
133
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
Boosting is a popular way to derive powerful learners from simpler hypothesis classes. Following previous work (Mason et al., 1999; Friedman, 2000) on general boosting frameworks,...
154
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
In this work, we introduce a novel implicit representation of shape which is based on assigning to each pixel a probability that this pixel is inside the shape. This probabilistic...
123
click to vote
ACCV
2007
Springer
15 years 10 months ago
2007
Springer
This paper introduces a novel convex kernel based method for color constancy computation with explicit illuminant parameter estimation. A simple linear render model is adopted and ...
138
click to vote
SIAMJO
2000
15 years 3 months ago
2000
Abstract. We propose a BFGS primal-dual interior point method for minimizing a convex function on a convex set defined by equality and inequality constraints. The algorithm generat...