1303 search results - page 172 / 261 » Cyclic Association Rules |
160
click to vote
DAGSTUHL
2006
15 years 7 months ago
2006
Abstract. In the context of an approach for reengineering legacy software systems at the architectural level, we present in this paper a reverse engineering methodology that uses a...
146
click to vote
GG
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. Adaptive star grammars generalize well-known graph grammar formalisms based on hyperedge and node replacement while retaining, e.g., parseability and the commutativity an...
188
click to vote
ENTCS
2002
15 years 6 months ago
2002
The last few years have seen the development of a new calculus which can be considered as an outcome of the last decade of various researches on (higher order) term rewriting syst...
184
click to vote
WAIM
2010
Springer
15 years 4 months ago
2010
Springer
In this paper we propose a generic model to generate basic multi-partite graphs obtained by associations found in arbitrary data. The interest of such a model is to be the formal ...
179
click to vote
WRLA
2010
15 years 4 months ago
2010
For a rewrite theory to be executable, its equations E should be (ground) confluent and terminating modulo the given axioms A, and their rules should be (ground) coherent with E m...