6105 search results - page 380 / 1221 » A Parallel Algorithm for Bound-Smoothing |
185
click to vote
EUROPAR
2005
Springer
16 years 10 days ago
2005
Springer
Sophisticated parallel matrix multiplication algorithms like PDGEMM exhibit a complex structure and can be controlled by a large set of parameters including blocking factors and bl...
178
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
: Cluster systems gain more and more importance as a platform for parallel computing. In this area the power of the system is strongly coupled with the performance of the network, ...
197
click to vote
JPDC
2000
15 years 6 months ago
2000
A new class of interconnection networks, the hypernetworks, has been proposed recently. Hypernetworks are characterized by hypergraphs. Compared with point-to-point networks, they...
198
Voted
PPSN
2010
Springer
15 years 5 months ago
2010
Springer
In the paper we propose a new evolutionary algorithm for induction of univariate regression trees that associate leaves with simple linear regression models. In contrast to typical...
188
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
The Smith-Waterman (SW) algorithm is one of the widely used algorithms for sequence alignment in computational biology. With the growing size of the sequence database, there is alw...