PDCAT
2009
Springer
14 years 6 months ago
2009
Springer
An immense amount of information is processed on the Internet due to its spread, increasing the severity of such problems as the disclosure of personal information; privacy protec...
PDCAT
2009
Springer
14 years 6 months ago
2009
Springer
Abstract— In symbolic computation, polynomial multiplication is a fundamental operation akin to matrix multiplication in numerical computation. We present efficient implementati...
PDCAT
2009
Springer
14 years 6 months ago
2009
Springer
PDCAT
2009
Springer
14 years 6 months ago
2009
Springer
PDCAT
2009
Springer
14 years 6 months ago
2009
Springer
—In the crash-recovery failure model of asynchronous distributed systems, processes can temporarily stop to execute steps and later restart their computation from a predefined l...
PDCAT
2009
Springer
14 years 6 months ago
2009
Springer
Abstract—Awerbuch and Scheideler have shown that peerto-peer overlays networks can survive Byzantine attacks only if malicious nodes are not able to predict what will be the topo...
PDCAT
2009
Springer
14 years 6 months ago
2009
Springer
—We have proposed an auto-memoization processor. This processor automatically and dynamically memoizes both functions and loop iterations, and skips their execution by reusing th...
PDCAT
2009
Springer
14 years 6 months ago
2009
Springer
With the advent of multi-core processors, desktop application developers must finally face parallel computing and its challenges. A large portion of the computational load in a p...
PACT
2009
Springer
14 years 6 months ago
2009
Springer
PACT
2009
Springer
14 years 6 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...