Sciweavers

133 search results - page 14 / 27
» Multithreaded algorithms for the fast Fourier transform
Sort
View
ICML
2009
IEEE
14 years 11 months ago
Bandit-based optimization on graphs with application to library performance tuning
The problem of choosing fast implementations for a class of recursive algorithms such as the fast Fourier transforms can be formulated as an optimization problem over the language...
Arpad Rimmel, Frédéric de Mesmay, Ma...
ICIP
2000
IEEE
15 years 12 days ago
POCS-Based Image Reconstruction from Irregularly-Spaced Samples
This paper presents a method for the reconstruction of a regularlysampled image from its irregularly-spaced samples. Such reconstruction is often needed in image processing and co...
Ryszard Stasinski, Janusz Konrad
ISAAC
2003
Springer
141views Algorithms» more  ISAAC 2003»
14 years 4 months ago
Quasi-optimal Arithmetic for Quaternion Polynomials
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...
Martin Ziegler
ACIVS
2009
Springer
13 years 8 months ago
Enhanced Low-Resolution Pruning for Fast Full-Search Template Matching
Abstract. Gharavi-Alkhansari [1] proposed a full-search equivalent algorithm for speeding-up template matching based on Lp-norm distance measures. This algorithm performs a pruning...
Stefano Mattoccia, Federico Tombari, Luigi di Stef...
CORR
2011
Springer
151views Education» more  CORR 2011»
13 years 5 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