Sciweavers

1357 search results - page 111 / 272
» Compositionality in Graph Transformation
Sort
View
VL
2005
IEEE
15 years 9 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
ICPP
1999
IEEE
15 years 7 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...
132
Voted
TSP
2010
14 years 10 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
118
Voted
DAC
2002
ACM
16 years 4 months ago
Efficient code synthesis from extended dataflow graphs for multimedia applications
This paper presents efficient automatic code synthesis techniques from dataflow graphs for multimedia applications. Since multimedia applications require large size buffers contai...
Hyunok Oh, Soonhoi Ha
130
Voted
CAI
2009
Springer
15 years 10 months ago
The Graph Programming Language GP
Abstract. GP (for Graph Programs) is a rule-based, nondeterministic programming language for solving graph problems at a high level of abstraction, freeing programmers from handlin...
Detlef Plump