COMPUTING
2008
13 years 4 months ago
2008
In this work, we use conformal mapping to transform harmonic Dirichlet problems that are defined in simply
NIPS
2003
13 years 6 months ago
2003
Discrete Fourier transforms and other related Fourier methods have been practically implementable due to the fast Fourier transform (FFT). However there are many situations where ...
ERSHOV
2003
Springer
13 years 9 months ago
2003
Springer
We provide a polymorphic framework for radix-n Fast Fourier Transforms (FFTs) where all known kinds of monomoporhic radix-n algorithms can be obtained by specialization. The framew...
SOFSEM
2007
Springer
13 years 10 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...
ICML
2009
IEEE
14 years 5 months ago
2009
IEEE
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...