84 search results - page 3 / 17 » Fast Convolution |
WSCG
2000
13 years 6 months ago
2000
Fast Oriented Line Integral Convolution (FROLIC), which is a variant of LIC, illustrates 2D vector fields by approximating a streamlet by a set of disks with varying intensity. FR...
EUROCRYPT
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. This paper describes new methods for fast correlation attacks, based on the theory of convolutional codes. They can be applied to arbitrary LFSR feedback polynomials, in ...
ARITH
2005
IEEE
13 years 11 months ago
2005
IEEE
Abstract— Modular reduction is a fundamental operation in cryptographic systems. Most well known modular reduction methods including Barrett’s and Montgomery’s algorithms lev...
SIAMSC
2008
13 years 5 months ago
2008
To approximate convolutions which occur in evolution equations with memory terms, a variable-stepsize algorithm is presented for which advancing N steps requires only O(N log N) op...
IWOCA
2009
Springer
13 years 12 months ago
2009
Springer
We develop a method for performing boolean convolutions efficiently in word RAM model of computation, having a word size of w = Ω(log n) bits, where n is the input size. The tech...