Sciweavers

225 search results - page 24 / 45
» The Future Fast Fourier Transform
Sort
View
JCP
2007
104views more  JCP 2007»
13 years 8 months ago
Cyclic Convolution Algorithm Formulations Using Polynomial Transform Theory
— This work presents a mathematical framework for the development of efficient algorithms for cyclic convolution computations. The framework is based on the Chinese Reminder Theo...
Abraham H. Diaz-Perez, Domingo Rodríguez
BMVC
2002
13 years 11 months ago
Orientation Correlation
A new method of translational image registration is presented: orientation correlation. The method is fast, exhaustive, statistically robust, and illumination invariant. No existi...
A. J. Fitch, Alexander Kadyrov, William J. Christm...
SIGMOD
2010
ACM
186views Database» more  SIGMOD 2010»
14 years 1 months ago
Fast approximate correlation for massive time-series data
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
Abdullah Mueen, Suman Nath, Jie Liu
FSE
2008
Springer
91views Cryptology» more  FSE 2008»
13 years 10 months ago
SWIFFT: A Modest Proposal for FFT Hashing
We propose SWIFFT, a collection of compression functions that are highly parallelizable and admit very efficient implementations on modern microprocessors. The main technique under...
Vadim Lyubashevsky, Daniele Micciancio, Chris Peik...
FOCM
2008
156views more  FOCM 2008»
13 years 8 months ago
Random Sampling of Sparse Trigonometric Polynomials, II. Orthogonal Matching Pursuit versus Basis Pursuit
We investigate the problem of reconstructing sparse multivariate trigonometric polynomials from few randomly taken samples by Basis Pursuit and greedy algorithms such as Orthogona...
Stefan Kunis, Holger Rauhut