Sciweavers

1550 search results - page 147 / 310
» Benchmarking for Graph Transformation
Sort
View
ICPR
2008
IEEE
16 years 4 months ago
A coordinate system for articulated 2D shape point correspondences
A framework for mapping a polar-like coordinate system to a non-rigid shape is presented. Using a graph pyramid, a binary shape is decomposed into connected parts, based on its st...
Adrian Ion, Salvador B. López Mármol...
AGTIVE
2003
Springer
15 years 8 months ago
UML Interaction Diagrams: Correct Translation of Sequence Diagrams into Collaboration Diagrams
In this paper, the two types of UML interaction diagrams are considered. A translation of sequence diagrams into collaboration diagrams is constructed by means of graph transformat...
Björn Cordes, Karsten Hölscher, Hans-J&o...
ENTCS
2008
114views more  ENTCS 2008»
15 years 3 months ago
Term-graph Rewriting in Tom Using Relative Positions
In this paper, we present the implementation in Tom of a de Bruijn indices generalization allowing the representation of term-graphs over an algebraic signature. By adding pattern...
Emilie Balland, Paul Brauner
ECEASST
2006
123views more  ECEASST 2006»
15 years 3 months ago
Algebraic High-Level Nets as Weak Adhesive HLR Categories
Abstract. Adhesive high-level replacement (HLR) system have been recently introduced as a new categorical framework for graph transformation in the double pushout approach [1, 2]. ...
Ulrike Prange
CP
2003
Springer
15 years 8 months ago
Using Constraint Programming to Solve the Maximum Clique Problem
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
Jean-Charles Régin