3281 search results - page 152 / 657 » Bases for parametrized iterativity |
96
Voted
ALT
2008
Springer
15 years 10 months ago
2008
Springer
In this paper we discuss boosting algorithms that maximize the soft margin of the produced linear combination of base hypotheses. LPBoost is the most straightforward boosting algor...
ICS
2009
Tsinghua U.
15 years 8 months ago
2009
Tsinghua U.
We describe heterogeneous multi-CPU and multi-GPU implementations of Jacobi’s iterative method for the 2-D Poisson equation on a structured grid, in both single- and doublepreci...
105
Voted
IPPS
2006
IEEE
15 years 7 months ago
2006
IEEE
While it is possible to accurately predict the execution time of a given iteration of an adaptive application, it is not generally possible to predict the data-dependent adaptive ...
116
Voted
ASPDAC
2009
ACM
15 years 5 months ago
2009
ACM
Global routing is an important step for physical design. In this paper, we develop a new global router, NTUgr, that contains three major steps: prerouting, initial routing, and enh...
117
click to vote
PC
2008
15 years 1 months ago
2008
Traditional large sparse linear solvers are not suited in a grid computing environment as they require a large amount of synchronization and communication penalizing the performan...