150 search results - page 10 / 30 » Fast Unimodular Counting |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We present algorithms for the discrete cosine transform (DCT) and discrete sine transform (DST), of types II and III, that achieve a lower count of real multiplications and additi...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We present algorithms for the type-IV discrete cosine transform (DCT-IV) and discrete sine transform (DST-IV), as well as for the modified discrete cosine transform (MDCT) and it...
ESA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
SACRYPT
2001
Springer
13 years 12 months ago
2001
Springer
—For cryptographic applications, normal bases have received considerable attention, especially for hardware implementation. In this article, we consider fast software algorithms ...
ICPR
2000
IEEE
14 years 8 months ago
2000
IEEE
Motion estimation in image sequences is an important step in many computer vision and image processing applications. Several methods for solving this problem have been proposed, b...