6542 search results - page 246 / 1309 » The tao of parallelism in algorithms |
169
click to vote
PPL
2006
15 years 6 months ago
2006
A new computational paradigm is described which o ers the possibility of superlinear and sometimes unbounded speedup, when parallel computation is used. The computations involved ...
176
click to vote
PC
1998
15 years 6 months ago
1998
The Fast Fourier Transform (FFT) plays a key role in many areas of computational science and engineering. Although most one-dimensional FFT problems canbe entirely solvedentirely ...
195
click to vote
CLUSTER
2003
IEEE
16 years 5 hour ago
2003
IEEE
Dynamic programming is an important algorithm design technique in computational biology and scientific computing. Typical applications using this technique are very compute-intens...
201
click to vote
PDP
2006
IEEE
16 years 21 days ago
2006
IEEE
Re-ranking the search results using PageRank is a well-known technique used in modern search engines. Running an iterative algorithm like PageRank on a large web graph consumes bo...
177
Voted
ICPP
2005
IEEE
16 years 9 days ago
2005
IEEE
We show how a series of transformations can be applied to a sequential program to obtain programs that represent successive steps in exploiting parallelism in the original algorit...