187 search results - page 27 / 38 » Alternatives to the discrete fourier transform |
98
Voted
PKC
2009
Springer
16 years 9 days ago
2009
Springer
Similar to verifiable shuffling (or, mixing), we consider the problem of verifiable rotating (and random re-encrypting) a given list of homomorphic encryptions. The offset by which...
100
click to vote
FPT
2005
IEEE
15 years 5 months ago
2005
IEEE
Two FPGA implementations of a Shape Adaptive Discrete Cosine Transform (SA-DCT) accelerator are presented in this paper: one PCI-based and the other AMBA-based. The former is used...
SIGMETRICS
2006
ACM
15 years 5 months ago
2006
ACM
A new methodology to assess transient performance measures of tree-like processes is proposed by introducing the concept of tree-like processes with marked time epochs. As opposed...
101
click to vote
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
A discrete distribution D over Σ1 × · · · × Σn is called (non-uniform) k-wise independent if for any set of k indexes {i1, . . . , ik} and for any z1 ∈ Σi1 , . . . , zk ...
118
click to vote
STACS
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...