Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
COMPUTING
2008
114views more  COMPUTING 2008»
11 years 1 months ago
Conformal mapping for the efficient MFS solution of Dirichlet boundary value problems
In this work, we use conformal mapping to transform harmonic Dirichlet problems that are defined in simply
Andreas Karageorghis, Yiorgos Sokratis Smyrlis
NIPS
2003
11 years 2 months ago
Generalised Propagation for Fast Fourier Transforms with Partial or Missing Data
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 ...
Amos J. Storkey
ERSHOV
2003
Springer
11 years 6 months ago
A Polymorphic Radix- n Framework for Fast Fourier Transforms
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...
Marcin Zalewski, Sibylle Schupp
SOFSEM
2007
Springer
11 years 7 months ago
Fast Approximate Point Set Matching for Information Retrieval
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...
Raphaël Clifford, Benjamin Sach
ICML
2009
IEEE
12 years 2 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...
books