57 search results - page 9 / 12 » An Optimal Parallel Algorithm for Sorting Multisets |
IPPS
1998
IEEE
14 years 25 days ago
1998
IEEE
It was open for more than eight years to obtain an algorithm for computing the convex hull of a set of n sorted points in sub-logarithmic time on a reconfigurable mesh of size pn ...
ICDT
2001
ACM
14 years 1 months ago
2001
ACM
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
IPPS
1999
IEEE
14 years 26 days ago
1999
IEEE
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
BMCBI
2010
13 years 8 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...
IPPS
1997
IEEE
14 years 4 days ago
1997
IEEE
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...