6105 search results - page 435 / 1221 » A Parallel Algorithm for Bound-Smoothing |
208
click to vote
SPAA
2004
ACM
16 years 9 days ago
2004
ACM
The literature describes two high performance concurrent stack algorithms based on combining funnels and elimination trees. Unfortunately, the funnels are linearizable but blockin...
184
click to vote
EUROPAR
1999
Springer
15 years 11 months ago
1999
Springer
Recently, a number of graph partitioning applications have emerged with additional requirements that the traditional graph partitioning model alone cannot e ectively handle. One s...
164
click to vote
ICPP
1993
IEEE
15 years 11 months ago
1993
IEEE
:. In designing application-specific bit-level architectures and in programming existing bit-level processor arrays, it is necessary to expand a word-level algorithm into its bit-...
200
click to vote
IJIT
2004
15 years 8 months ago
2004
One of the major problems in genomic field is to perform sequence comparison on DNA and protein sequences. Executing sequence comparison on the DNA and protein data is a computatio...
170
click to vote
TC
2008
15 years 6 months ago
2008
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...