618 search results - page 1 / 124 » Reducibility and TT-Lifting for Computation Types |
TLCA
2005
Springer
13 years 9 months ago
2005
Springer
APL
1998
ACM
13 years 8 months ago
1998
ACM
This article describes how array predicates were used to reduce the computational complexity of four APL primitive functions when one of their arguments is a permutation vector. T...
CRYPTO
2000
Springer
13 years 8 months ago
2000
Springer
Secure Function Evaluation (SFE) protocols are very hard to design, and reducibility has been recognized as a highly desirable property of SFE protocols. Informally speaking, reduc...
SIGPRO
2008
13 years 4 months ago
2008
: In this letter, an efficient algorithm for three-dimensional (3-D) vector radix decimation in frequency is derived for computing the type-III 3-D discrete W transform (DWT). Comp...
DCG
2010
13 years 2 months ago
2010
A new approach to algorithmic computation of the homology of spaces and maps is presented. The key point of the approach is a change in the representation of sets. The proposed rep...