5675 search results - page 945 / 1135 » Exploiting Chaos for Computation |
211
click to vote
HIPC
2007
Springer
16 years 1 months ago
2007
Springer
The Fast Fourier Transform (FFT) is of primary importance and a fundamental kernel in many computationally intensive scientific applications. In this paper we investigate its perf...
212
click to vote
ICS
2007
Tsinghua U.
16 years 1 months ago
2007
Tsinghua U.
Large-scale parallel computing is relying increasingly on clusters with thousands of processors. At such large counts of compute nodes, faults are becoming common place. Current t...
189
click to vote
STACS
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
195
click to vote
ACSC
2006
IEEE
16 years 1 months ago
2006
IEEE
Publish/subscribe systems utilize filter algorithms to determine all subscriptions matching incoming event messages. To distribute such services, subscriptions are forwarded to s...
221
click to vote
ICPP
2006
IEEE
16 years 1 months ago
2006
IEEE
This paper discusses fast parallel algorithms for evaluating several centrality indices frequently used in complex network analysis. These algorithms have been optimized to exploi...