Sciweavers

1153 search results - page 104 / 231
» Reversing graph transformations
Sort
View
VL
2005
IEEE
15 years 6 months ago
Transformation of UML State Machines for Direct Execution
Executable UML models are nowadays gaining interest in embedded systems design. This domain is strongly devoted to the modeling of reactive behavior using StateChart variants. In ...
Tim Schattkowsky, Wolfgang Müller 0003
120
Voted
ICPP
1999
IEEE
15 years 5 months ago
A Framework for Interprocedural Locality Optimization Using Both Loop and Data Layout Transformations
There has been much work recently on improving the locality performance of loop nests in scientific programs through the use of loop as well as data layout optimizations. However,...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
104
Voted
TSP
2010
14 years 7 months ago
Fast algorithms for the computation of sliding sequency-ordered complex hadamard transform
Fast algorithms for computing the forward and inverse sequency-ordered complex Hadamard transforms (SCHT) in a sliding window are presented. The first algorithm consists of decompo...
Jiasong Wu, Huazhong Shu, Lu Wang, Lotfi Senhadji
ICML
2009
IEEE
16 years 1 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...
211
Voted
POPL
2002
ACM
16 years 1 months ago
Composing dataflow analyses and transformations
Dataflow analyses can have mutually beneficial interactions. Previous efforts to exploit these interactions have either (1) iteratively performed each individual analysis until no...
Sorin Lerner, David Grove, Craig Chambers