Sciweavers

113 search results - page 15 / 23
» Fast algorithms for discrete polynomial transforms
Sort
View
COMPUTING
2006
112views more  COMPUTING 2006»
13 years 8 months ago
Fast Summation of Radial Functions on the Sphere
Radial functions are a powerful tool in many areas of multidimensional approximation, especially when dealing with scattered data. We present a fast approximate algorithm for the ...
Jens Keiner, Stefan Kunis, Daniel Potts
JISE
2006
85views more  JISE 2006»
13 years 8 months ago
A Programming Methodology for Designing Block Recursive Algorithms
In this paper, we use the tensor product notation as the framework of a programming methodology for designing block recursive algorithms. We first express a computational problem ...
Min-Hsuan Fan, Chua-Huang Huang, Yeh-Ching Chung, ...
CORR
2011
Springer
151views Education» more  CORR 2011»
13 years 3 months ago
Generating and Searching Families of FFT Algorithms
A fundamental question of longstanding theoretical interest is to prove the lowest exact count of real additions and multiplications required to compute a power-of-two discrete Fo...
Steve Haynal, Heidi Haynal
ICASSP
2008
IEEE
14 years 3 months ago
A detection algorithm for zero-quantized DCT coefficients in JPEG
The discrete cosine transform (DCT) is widely used in image/video coding standards. However, since most DCT coefficients will be quantized to zeros, a large number of redundant co...
Jin Li, Jarmo Takala, Moncef Gabbouj, Hexin Chen
IAJIT
2008
201views more  IAJIT 2008»
13 years 8 months ago
Implementation of a Novel Efficient Multiwavelet Based Video Coding Algorithm
: The recent explosion in digital video storage and delivery has presented strong motivation for high performance video compression solutions. An efficient video compression techni...
Sudhakar Radhakrishnan, Jayaraman Subramaniam