Sciweavers

1357 search results - page 35 / 272
» Compositionality in Graph Transformation
Sort
View
FUIN
2007
95views more  FUIN 2007»
15 years 2 months ago
Compositional Systems over Reducible Networks
Abstract. In the paper two notions related to local (distributed) computations are identified and discussed. The first one is the notion of reducible graphs. A graph is reducible...
Antoni W. Mazurkiewicz
ICML
2009
IEEE
16 years 3 months ago
Learning spectral graph transformations for link prediction
We present a unified framework for learning link prediction and edge weight prediction functions in large networks, based on the transformation of a graph's algebraic spectru...
Andreas Lommatzsch, Jérôme Kunegis
WSR
2008
15 years 3 months ago
Graph Technology in Reverse Engineering: The TGraph Approach
: TGraphs are directed graphs with typed, attributed, and ordered nodes and edges. These properties leverage the use of graphs as models for all kinds of artifacts in the context o...
Jürgen Ebert, Volker Riediger, Andreas Winter
ERSHOV
2006
Springer
15 years 4 months ago
On the Usage of Concrete Syntax in Model Transformation Rules
Graph transformations are one of the best known approaches for defining transformations in model-based software development. They are defined over the abstract syntax of source and...
Thomas Baar, Jon Whittle
CORR
2010
Springer
198views Education» more  CORR 2010»
14 years 11 months ago
Convex Graph Invariants
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
Venkat Chandrasekaran, Pablo A. Parrilo, Alan S. W...