1550 search results - page 105 / 310 » Benchmarking for Graph Transformation |
136
click to vote
CIDM
2009
IEEE
15 years 7 months ago
2009
IEEE
The graph classification problem is learning to classify separate, individual graphs in a graph database into two or more categories. A number of algorithms have been introduced fo...
122
click to vote
SAT
2004
Springer
15 years 8 months ago
2004
Springer
We define a collection of mappings that transform many-valued clausal forms into satisfiability equivalent Boolean clausal forms, analyze their complexity and evaluate them empir...
107
click to vote
ICCAD
1997
IEEE
15 years 7 months ago
1997
IEEE
Presynthesis optimizations transform a behavioral HDL description into an optimized HDL description that results in improved synthesis results. In this paper we introduce the decom...
139
click to vote
KDD
2009
ACM
16 years 3 months ago
2009
ACM
Our dynamic graph-based relational mining approach has been developed to learn structural patterns in biological networks as they change over time. The analysis of dynamic network...
119
click to vote
ATAL
2005
Springer
15 years 8 months ago
2005
Springer
2. THE MASM ALGORITHM An input to the MASM algorithm is a time-annotated multi-agent action sequence. The action sequence is then transformed into an action graph. An action graph ...