6105 search results - page 31 / 1221 » A Parallel Algorithm for Bound-Smoothing |
DCAI
2008
15 years 4 months ago
2008
129
click to vote
BCB
2010
14 years 9 months ago
2010
Many biologically motivated problems are expressed as dynamic programming recurrences and are difficult to parallelize due to the intrinsic data dependencies in their algorithms. ...
121
Voted
PVM
2010
Springer
15 years 20 days ago
2010
Springer
Abstract. In this work we present two algorithms of irregular scatter/gather operations based on the binomial tree and Tr¨aff algorithms. We use the prediction provided by hetero...
111
Voted
IPPS
2010
IEEE
15 years 5 days ago
2010
IEEE
We address the design of algorithms for multicores that are oblivious to machine parameters. We propose HM, a multicore model consisting of a parallel shared-memory machine with hi...
135
Voted
IEEEHPCS
2010
15 years 23 days ago
2010
The problem of closed frequent itemset discovery is a fundamental problem of data mining, having applications in numerous domains. It is thus very important to have efficient par...