Abstract. Triple Graph Grammars (TGGs) are a well-established concept for the specification of model transformations. In previous work we have formalized and analyzed already cruc...
Frank Hermann, Hartmut Ehrig, Fernando Orejas, Ulr...
We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible...
A loose semantics for graph transformation rules which has been developed recently is used in this paper for the compositional verification of specifications. The main conceptual t...
We consider a framework for semi-supervised learning using spectral decomposition-based unsupervised kernel design. We relate this approach to previously proposed semi-supervised l...
In this paper, a colour text/graphics segmentation is proposed. Firstly, it takes advantage of colour properties by computing a relevant hybrid colour model. Then an edge detectio...