432 search results - page 16 / 87 » Internally deterministic parallel algorithms can be fast |
PPAM
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...
97
Voted
BMCBI
2004
14 years 9 months ago
2004
Background: Parallel computing is frequently used to speed up computationally expensive tasks in Bioinformatics. Results: Herein, a parallel version of the multi-alignment program...
87
Voted
PC
2002
14 years 9 months ago
2002
We present a new parallel algorithm to compute an exact triangularization of large square or rectangular and dense or sparse matrices in any field. Using fast matrix multiplicatio...
ICCD
1997
IEEE
15 years 1 months ago
1997
IEEE
In this paper, we present a parallel-array implementation of a new non-restoring square root algorithm (PASQRT). The carry-save adder (CSA) is used in the parallel array. The PASQ...
ECOOPW
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. We introduce a collection of high performance kernels for basic linear algebra. The kernels encapsulate small xed size computations in order to provide building blocks fo...