6939 search results - page 317 / 1388 » Algorithm Engineering for Parallel Computation |
146
Voted
PACT
2009
Springer
15 years 9 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...
136
click to vote
ICPP
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract— We examine the problem of parallelizing the inferencing process for OWL knowledge-bases. A key challenge in this problem is partitioning the computational workload of t...
114
click to vote
EUROPAR
2009
Springer
15 years 10 months ago
2009
Springer
The transition to multicore architectures has dramatically underscored the necessity for parallelism in software. In particular, while new gaming consoles are by and large multicor...
148
click to vote
DMIN
2009
15 years 1 months ago
2009
While the emerging field of privacy preserving data mining (PPDM) will enable many new data mining applications, it suffers from several practical difficulties. PPDM algorithms are...
136
click to vote
PDP
2005
IEEE
15 years 9 months ago
2005
IEEE
the emergence of Internet and new kind of architecture, likepeer-to-peer (P2P) networks, provides great hope for distributed computation. However, the combination of the world of ...