Sciweavers

1550 search results - page 76 / 310
» Benchmarking for Graph Transformation
Sort
View
VL
2007
IEEE
104views Visual Languages» more  VL 2007»
15 years 7 months ago
A Peirce Style Calculus for ALC
Description logics (DLs) are a well-understood family of knowledge representation (KR) languages. The notation of DLs has the flavour of a variable-free first order predicate lo...
Frithjof Dau, Peter W. Eklund
GBRPR
2007
Springer
15 years 5 months ago
Constellations and the Unsupervised Learning of Graphs
Abstract. In this paper, we propose a novel method for the unsupervised clustering of graphs in the context of the constellation approach to object recognition. Such method is an E...
Boyan Bonev, Francisco Escolano, Miguel Angel Loza...
CGVR
2008
15 years 2 months ago
A Graph Drawing Algorithm for the Game of Sprouts
- A graph drawing algorithm for the Game of Sprouts is presented. The algorithm guarantees that the polylines that connect graph nodes are drawn smoothly and that they maintain rea...
Wayne Brown, Leemon C. Baird III
ECEASST
2010
14 years 10 months ago
Graph Algebras for Bigraphs
In this talk we will present a new approach to deal with attributed graphs and attributed graph transformation. The approach is based on working with what we call symbolic graphs, ...
Davide Grohmann, Marino Miculan
ENTCS
2006
183views more  ENTCS 2006»
15 years 1 months ago
Metamodel-Based Model Transformation with Aspect-Oriented Constraints
Model transformation means converting an input model available at the beginning of the transformation process to an output model. A widely used approach to model transformation us...
László Lengyel, Tihamer Levendovszky...