113 search results - page 5 / 23 » Fast algorithms for discrete polynomial transforms |
FP
1989
14 years 20 days ago
1989
This paper reports an explanation of an intricate algorithm in the terms of a potentially mechanisable rigorous-development method. It uses notations and techniques of Sheeran 1] ...
NA
2006
13 years 8 months ago
2006
Abstract. The present article summarizes the state of the art algorithms to compute the discrete Moreau envelope, and presents a new linear-time algorithm, named NEP for NonExpansi...
CORR
2007
Springer
13 years 8 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...
ISCAS
2003
IEEE
14 years 1 months ago
2003
IEEE
In this paper, a robust and efficient digital image watermarking algorithm using the fast Hadamard transform (FHT) is proposed for the copyright protection of digital images. This...
IPPS
2003
IEEE
14 years 1 months ago
2003
IEEE
In this paper we use a mathematical approach to automatically generate high performance short vector code for the discrete Fourier transform (DFT). We represent the well-known Coo...