255 search results - page 40 / 51 » Generalized Boosting Algorithms for Convex Optimization |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The group Lasso is an extension of the Lasso for feature selection on (predefined) non-overlapping groups of features. The non-overlapping group structure limits its applicability...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
Ranking is a key problem in many information retrieval (IR) applications, such as document retrieval and collaborative filtering. In this paper, we address the issue of learning ...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
Generative representations allow the reuse of code and thus facilitate the evolution of repeated phenotypic themes or modules. It has been shown that generative representations pe...
ICPR
2008
IEEE
14 years 8 months ago
2008
IEEE
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
SODA
1993
ACM
13 years 9 months ago
1993
ACM
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...