141 search results - page 24 / 29 » Learning r-of-k Functions by Boosting |
SODA
2008
ACM
13 years 8 months ago
2008
ACM
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
AIPS
2008
13 years 9 months ago
2008
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computat...
CVPR
2007
IEEE
14 years 8 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...
IVC
2006
13 years 6 months ago
2006
We present a systematic comparison of machine learning methods applied to the problem of fully automatic recognition of facial expressions, including AdaBoost, support vector mach...
CVPR
2008
IEEE
14 years 8 months ago
2008
IEEE
Because of the large variation across different environments, a generic classifier trained on extensive data-sets may perform sub-optimally in a particular test environment. In th...