Sciweavers

866 search results - page 68 / 174
» Bidirectionalizing graph transformations
Sort
View
DELTA
2004
IEEE
15 years 1 months ago
Arithmetic Transformations to Maximise the Use of Compressor Trees
Complex arithmetic computations, especially if derived from bit-level software descriptions, can be very inefficient if implemented directly in hardware (e.g., by translation of t...
Paolo Ienne, Ajay K. Verma
GG
2004
Springer
15 years 3 months ago
Towards Graph Programs for Graph Algorithms
Abstract. Graph programs as introduced by Habel and Plump [8] provide a simple yet computationally complete language for computing functions and relations on graphs. We extend this...
Detlef Plump, Sandra Steinert
GD
2003
Springer
15 years 3 months ago
Intersection-Free Morphing of Planar Graphs
Given two different drawings of a planar graph we consider the problem of morphing one drawing into the other. We designed and implemented an algorithm for intersection-free morph...
Cesim Erten, Stephen G. Kobourov, Chandan Pitta
LR
2011
108views more  LR 2011»
14 years 20 days ago
Modeling production networks with discrete processes by means of communities of autonomous units
Abstract Communities of autonomous units are devices for the visual modeling of interactive logistic processes. The framework is founded on rule-based graph transformation and allo...
Hans-Jörg Kreowski, Sabine Kuske, Caroline vo...
CGF
1998
104views more  CGF 1998»
14 years 9 months ago
Animation of Biological Organ Growth Based on L-systems
In contrast with the growth of plants and trees, human organs can undergo signi cant changes in shape through a variety of global transformations during the growth period, such as...
Roman Durikovic, Kazufumi Kaneda, Hideo Yamashita