Sciweavers

1174 search results - page 158 / 235
» Boosting for transfer learning
Sort
View
ECML
2004
Springer
14 years 3 months ago
Improving Random Forests
Random forests are one of the most successful ensemble methods which exhibits performance on the level of boosting and support vector machines. The method is fast, robust to noise,...
Marko Robnik-Sikonja
DAGM
2007
Springer
14 years 1 months ago
Greedy-Based Design of Sparse Two-Stage SVMs for Fast Classification
Cascades of classifiers constitute an important architecture for fast object detection. While boosting of simple (weak) classifiers provides an established framework, the design of...
Rezaul Karim, Martin Bergtholdt, Jörg H. Kapp...
DAGM
2009
Springer
14 years 1 months ago
Training for Task Specific Keypoint Detection
In this paper, we show that a better performance can be achieved by training a keypoint detector to only find those points that are suitable to the needs of the given task. We demo...
Christoph Strecha, Albrecht Lindner, Karim Ali, Pa...
3DPVT
2004
IEEE
131views Visualization» more  3DPVT 2004»
14 years 1 months ago
Neural Mesh Ensembles
This paper proposes the use of neural network ensembles to boost the performance of a neural network based surface reconstruction algorithm. Ensemble is a very popular and powerfu...
Ioannis P. Ivrissimtzis, Yunjin Lee, Seungyong Lee...
SODA
2008
ACM
184views Algorithms» more  SODA 2008»
13 years 11 months ago
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
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-...
Kenneth L. Clarkson