1511 search results - page 94 / 303 » Hierarchical Graph Transformation |
121
click to vote
AEI
2008
15 years 4 months ago
2008
The paper proposes a methodology to assist the designer at the initial stages of the design synthesis process by enabling him/her to employ knowledge and algorithms existing in gr...
119
click to vote
JSW
2008
15 years 4 months ago
2008
Image quality loss resulting from artifacts depends on the nature and strength of the artifacts as well as the context or background in which they occur. In order to include the im...
137
Voted
CSR
2008
Springer
15 years 6 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, ...
142
click to vote
ACL
2010
15 years 2 months ago
2010
We propose a global algorithm for learning entailment relations between predicates. We define a graph structure over predicates that represents entailment relations as directed ed...
148
Voted
HPCC
2007
Springer
15 years 10 months ago
2007
Springer
Clustering of data has numerous applications and has been studied extensively. It is very important in Bioinformatics and data mining. Though many parallel algorithms have been des...