53 search results - page 6 / 11 » Maximal Lattice-Free Convex Sets in Linear Subspaces |
NIPS
2007
13 years 8 months ago
2007
We present a novel boosting algorithm, called SoftBoost, designed for sets of binary labeled examples that are not necessarily separable by convex combinations of base hypotheses....
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
In this paper, we present a new method to change the illumination condition of a face image, with unknown face geometry and albedo information. This problem is particularly diffic...
IJCV
2008
13 years 7 months ago
2008
For software and more illustrations: http://www.psi.utoronto.ca/anitha/fastTCA.htm Dimensionality reduction techniques such as principal component analysis and factor analysis are...
HYBRID
2004
Springer
14 years 12 days ago
2004
Springer
The joint spectral radius of a set of matrices is a measure of the maximal asymptotic growth rate that can be obtained by forming long products of matrices taken from the set. This...
SIAMJO
2008
13 years 7 months ago
2008
This paper concerns a fractional function of the form xT a/ xT Bx, where B is positive definite. We consider the game of choosing x from a convex set, to maximize the function, an...