Sciweavers

6365 search results - page 21 / 1273
» Fast Local Computation Algorithms
Sort
View
NA
2006
84views more  NA 2006»
14 years 9 months ago
Fast Moreau envelope computation I: numerical algorithms
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...
Yves Lucet
IPL
2000
97views more  IPL 2000»
14 years 9 months ago
A fast algorithm for computing large Fibonacci numbers
We present a fast algorithm for computing large Fibonacci numbers. It is known that the product of Lucas numbers algorithm uses the fewest bit operations to compute the Fibonacci ...
Daisuke Takahashi
SIGPRO
2008
130views more  SIGPRO 2008»
14 years 9 months ago
A fast algorithm for the computation of 2-D forward and inverse MDCT
A fast algorithm for computing the two-dimensional (2-D) forward and inverse modified discrete cosine transform (MDCT and IMDCT) is proposed. The algorithm converts the 2-D MDCT an...
J. S. Wu, Huazhong Shu, Lotfi Senhadji, Limin Luo
IPPS
1997
IEEE
15 years 1 months ago
A Fast Scalable Universal Matrix Multiplication Algorithm on Distributed-Memory Concurrent Computers
We present a fast and scalable matrix multiplication algorithm on distributed memory concurrent computers, whose performance is independent of data distribution on processors, and...
J. Choi
AMC
2008
111views more  AMC 2008»
14 years 10 months ago
Numerical stability of fast computation algorithms of Zernike moments
A detailed, comparative study of the numerical stability of the recursive algorithms, widely used to calculate the Zernike moments of an image, is presented in this paper. While m...
George A. Papakostas, Yiannis S. Boutalis, Constan...