Sciweavers

245 search results - page 29 / 49
» A Fast Fourier Transform Compiler
Sort
View
ICIP
2010
IEEE
14 years 7 months ago
Constructing a sparse convolution matrix for shift varying image restoration problems
Convolution operator is a linear operator characterized by a point spread functions (PSF). In classical image restoration problems, the blur is usually shift invariant and so the ...
Stanley H. Chan
COMPUTING
2006
112views more  COMPUTING 2006»
14 years 10 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
ARITH
2005
IEEE
15 years 3 months ago
Fast Modular Reduction for Large Wordlengths via One Linear and One Cyclic Convolution
Abstract— Modular reduction is a fundamental operation in cryptographic systems. Most well known modular reduction methods including Barrett’s and Montgomery’s algorithms lev...
Dhananjay S. Phatak, Tom Goff
ISMIR
2005
Springer
127views Music» more  ISMIR 2005»
15 years 3 months ago
Fast Capture of Sheet Music for an Agile Digital Music Library
A personal digital music library needs to be “agile”, that is, it needs to make it easy to capture and index material on the fly. A digital camera is a particularly effective...
Richard Lobb, Tim Bell, David Bainbridge
JISE
2006
85views more  JISE 2006»
14 years 9 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, ...