Sciweavers

1294 search results - page 79 / 259
» FFT Compiler Techniques
Sort
View
JSCIC
2010
178views more  JSCIC 2010»
13 years 3 months ago
A Compact Fourth Order Scheme for the Helmholtz Equation in Polar Coordinates
In many problems, one wishes to solve the Helmholtz equation in cylindrical or spherical coordinates which introduces variable coefficients within the differentiated terms. Fourth ...
S. Britt, S. Tsynkov, Eli Turkel
SODA
2012
ACM
209views Algorithms» more  SODA 2012»
11 years 11 months ago
Simple and practical algorithm for sparse Fourier transform
We consider the sparse Fourier transform problem: given a complex vector x of length n, and a parameter k, estimate the k largest (in magnitude) coefficients of the Fourier transf...
Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric ...
PLDI
2009
ACM
14 years 3 months ago
Trace-based just-in-time type specialization for dynamic languages
Dynamic languages such as JavaScript are more difficult to compile than statically typed ones. Since no concrete type information is available, traditional compilers need to emit...
Andreas Gal, Brendan Eich, Mike Shaver, David Ande...
SC
2005
ACM
14 years 2 months ago
Automatic Tuning of Inlining Heuristics
Inlining improves the performance of programs by reducing the overhead of method invocation and increasing the opportunities for compiler optimization. Incorrect inlining decision...
John Cavazos, Michael F. P. O'Boyle
ICCAD
2006
IEEE
180views Hardware» more  ICCAD 2006»
14 years 5 months ago
A bitmask-based code compression technique for embedded systems
Embedded systems are constrained by the available memory. Code compression techniques address this issue by reducing the code size of application programs. Dictionary-based code c...
Seok-Won Seong, Prabhat Mishra