874 search results - page 25 / 175 » Practical Algorithms for Selection on Coarse-Grained Paralle... |
PC
2000
15 years 1 months ago
2000
Three parallel optimisation algorithms for use in the context of multilevel graph partitioning for unstructured meshes are described. The first, interface optimisation reduces the...
122
click to vote
BMCBI
2010
15 years 1 months ago
2010
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
121
click to vote
PARA
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We consider parallel preconditioning schemes to accelerate the convergence of Conjugate Gradients (CG) for sparse linear system solution. We develop methods for construct...
122
click to vote
PPOPP
2012
ACM
13 years 9 months ago
2012
ACM
Speedups demonstrated for finding the biconnected components of a graph: 9x to 33x on the Explicit Multi-Threading (XMT) many-core computing platform relative to the best serial ...
108
click to vote
ICPP
2003
IEEE
15 years 6 months ago
2003
IEEE
Pairwise sequence alignment is a fundamental operation for homology search in bioinformatics. For two DNA or protein sequences of length ¢ and £ , full-matrix (FM), dynamic prog...