Sciweavers

1882 search results - page 101 / 377
» Transformational Programming and Forests
Sort
View
IEEEPACT
2009
IEEE
15 years 4 months ago
Automatic Tuning of Discrete Fourier Transforms Driven by Analytical Modeling
—Analytical models have been used to estimate optimal values for parameters such as tile sizes in the context of loop nests. However, important algorithms such as fast Fourier tr...
Basilio B. Fraguela, Yevgen Voronenko, Markus P&uu...
ISCAS
2008
IEEE
106views Hardware» more  ISCAS 2008»
15 years 4 months ago
Hilbert transformers with a piecewise-polynomial-sinusoidal impulse response
— Hilbert transformers are one of the very important special classes of finite impulse response (FIR) filters used in signal processing applications. A method is presented to s...
Raija Lehto, Tapio Saramäki, Olli Vainio
PKDD
2010
Springer
179views Data Mining» more  PKDD 2010»
14 years 7 months ago
Learning an Affine Transformation for Non-linear Dimensionality Reduction
The foremost nonlinear dimensionality reduction algorithms provide an embedding only for the given training data, with no straightforward extension for test points. This shortcomin...
Pooyan Khajehpour Tadavani, Ali Ghodsi
SIGADA
2005
Springer
15 years 3 months ago
Using ASIS to generate C++ bindings
In this paper, we describe an approach to automatically creating C++ bindings to Ada libraries utilizing capabilities of the Ada Semantic Interface Specification (ASIS). We discus...
Howard Ausden, Karl A. Nyberg
WCRE
1995
IEEE
15 years 1 months ago
Strongest Postcondition Semantics as the Formal Basis for Reverse Engineering
Reverse engineering of program code is the process of constructing a higher level abstraction of an implementation in order to facilitate the understanding of a system that may be...
Gerald C. Gannod, Betty H. C. Cheng