4074 search results - page 228 / 815 » Abstract Graph Transformation |
194
click to vote
PKDD
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. This paper proposes a novel approach named AGM to eciently mine the association rules among the frequently appearing substructures in a given graph data set. A graph tran...
162
click to vote
APVIS
2007
15 years 8 months ago
2007
The level-of-detail techniques presented in this paper enable a comprehensible interactive visualization of large and complex clustered graph layouts either in 2D or 3D. Implicit ...
167
click to vote
JGT
2006
15 years 6 months ago
2006
Abstract: A k-tree is a chordal graph with no (k + 2)-clique. An -treepartition of a graph G is a vertex partition of G into `bags,' such that contracting each bag to a single...
175
click to vote
EDOC
2005
IEEE
16 years 3 days ago
2005
IEEE
In model driven development (MDD), specifying transformations between models at various levels of ion can be a complex task. Specifying transformations for pervasive system featur...
176
click to vote
ISW
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Code obfuscations are semantics-preserving code transformations used to protect a program from reverse engineering. There is generally no expectation of complete, long-te...