Sciweavers

4074 search results - page 85 / 815
» Abstract Graph Transformation
Sort
View
TSP
2008
178views more  TSP 2008»
14 years 10 months ago
Digital Computation of Linear Canonical Transforms
Abstract--We deal with the problem of efficient and accurate digital computation of the samples of the linear canonical transform (LCT) of a function, from the samples of the origi...
A. Koc, Haldun M. Özaktas, Cagatay Candan, M....
LCPC
2009
Springer
15 years 2 months ago
Loop Transformation Recipes for Code Generation and Auto-Tuning
Abstract. In this paper, we describe transformation recipes, which provide a high-level interface to the code transformation and code generation capability of a compiler. These rec...
Mary W. Hall, Jacqueline Chame, Chun Chen, Jaewook...
WCRE
2000
IEEE
15 years 1 months ago
Reverse Engineering from Assembler to Formal Specifications via Program Transformations
The FermaT transformation system, based on research carried out over the last sixteen years at Durham University, De Montfort University and Software Migrations Ltd., is an indust...
Martin P. Ward
ENTCS
2006
125views more  ENTCS 2006»
14 years 10 months ago
Hoare vs Milner: Comparing Synchronizations in a Graphical Framework With Mobility
We compare the expressive power of Hoare (i.e., CSP style) and Milner (i.e., CCS style) synchronizations for defining graph transformations in a framework where edges can perform ...
Ivan Lanese, Ugo Montanari
JGT
2010
93views more  JGT 2010»
14 years 8 months ago
An asymptotic version of a conjecture by Enomoto and Ota
. Dirac. Some theorems on abstract graphs. Proc. London Math. Soc. (3), 2:69–81, 1952. [2] Hikoe Enomoto and Katsuhiro Ota. Partitions of a graph into paths with prescribed endve...
Colton Magnant, Daniel M. Martin