131 search results - page 7 / 27 » Two new regularized AdaBoost algorithms |
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
In this paper, a new fast Hartley transform (FHT) algorithmradix-22 suitable for pipeline implementation of the discrete Hartley transform (DHT) is presented. The proposed algorit...
JGAA
2006
14 years 9 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
ISSAC
2009
Springer
15 years 4 months ago
2009
Springer
The computation of triangular decompositions involves two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new...
101
click to vote
ECCV
2006
Springer
15 years 1 months ago
2006
Springer
Here we present a new image registration algorithm for the alignment of histological sections that combines the ideas of B-spline based elastic registration and consistent image re...
108
click to vote
NIPS
2007
14 years 11 months ago
2007
Learning the common structure shared by a set of supervised tasks is an important practical and theoretical problem. Knowledge of this structure may lead to better generalization ...