6542 search results - page 313 / 1309 » The tao of parallelism in algorithms |
210
click to vote
PACT
2009
Springer
16 years 1 months ago
2009
Springer
The notion of Fast Fourier Transformation (FFT) describes a range of efficient algorithms to compute the discrete Fourier transformation, frequency distribution in a signal. FFT pl...
173
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
Huge energy consumption has become a critical bottleneck for further applying large-scale cluster systems to build new data centers. Among various components of a data center, sto...
180
click to vote
ICPPW
2006
IEEE
16 years 25 days ago
2006
IEEE
Homotopy methods to solve polynomial systems are well suited for parallel computing because the solution paths defined by the homotopy can be tracked independently. For sparse po...
177
click to vote
IPPS
2006
IEEE
16 years 25 days ago
2006
IEEE
The GCA (Global Cellular Automata) model consists of a collection of cells which change their states synchronously depending on the states of their neighbors like in the classical...
177
click to vote
SBACPAD
2006
IEEE
2006
IEEE
Scalable Parallel Implementation of Bayesian Network to Junction Tree Conversion for Exact Inference
16 years 25 days ago
We present a scalable parallel implementation for converting a Bayesian network to a junction tree, which can then be used for a complete parallel implementation for exact inferen...