4074 search results - page 92 / 815 » Abstract Graph Transformation |
101
click to vote
FMCAD
2008
Springer
14 years 11 months ago
2008
Springer
el Sequential Memory Abstraction for Model Checking Per Bjesse Advanced Technology Group Synopsys Inc. Many designs intermingle large memories with wide data paths and nontrivial c...
TOSEM
2002
14 years 9 months ago
2002
d Abstraction of Class Diagrams ALEXANDER EGYED Teknowledge Corporation Designers can easily become overwhelmed with details when dealing with large class diagrams. icle presents a...
CSR
2008
Springer
14 years 11 months ago
2008
Springer
A function f of a graph is called a complete graph invariant if two given graphs G and H are isomorphic exactly when f(G) = f(H). If additionally, f(G) is a graph isomorphic to G, ...
UAI
1993
14 years 11 months ago
1993
Based Abstraction and Categorization Eric J. Horvitz∗ and Adrian C. Klein Palo Alto Laboratory Rockwell International Science Center 444 High Street Palo Alto, CA 94301 We take ...
107
click to vote
APVIS
2009
14 years 11 months ago
2009
Many graph visualization systems use graph hierarchies to organize a large input graph into logical components. These approaches detect features globally in the data and place the...