50 search results - page 4 / 10 » Deriving the Fast Fourier Algorithm by Calculation |
PADL
2000
Springer
13 years 11 months ago
2000
Springer
The general goal of data mining is to extract interesting correlated information from large collection of data. A key computationally-intensive subproblem of data mining involves ...
SOFSEM
2007
Springer
14 years 1 months ago
2007
Springer
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
BMCBI
2006
13 years 7 months ago
2006
Background: Statistical comparison of peptide profiles in biomarker discovery requires fast, userfriendly software for high throughput data analysis. Important features are flexib...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Algorithms are developed for calculating dealiased linear convolution sums without the expense of conventional zero-padding or phase-shift techniques. For one-dimensional in-place ...
IPPS
2003
IEEE
14 years 29 days ago
2003
IEEE
In this paper we use a mathematical approach to automatically generate high performance short vector code for the discrete Fourier transform (DFT). We represent the well-known Coo...