1511 search results - page 32 / 303 » Hierarchical Graph Transformation |
104
click to vote
ECCV
1998
Springer
16 years 3 months ago
1998
Springer
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
104
Voted
TLDI
2009
ACM
15 years 10 months ago
2009
ACM
For many object-oriented systems, it is often useful to have a runtime architecture that shows networks of communicating objects. But it is hard to statically extract runtime obje...
122
click to vote
CVPR
2004
IEEE
16 years 3 months ago
2004
IEEE
Many vision tasks can be formulated as partitioning an adjacency graph through optimizing a Bayesian posterior probability p defined on the partition-space. In this paper two appr...
129
Voted
TAGT
1998
Springer
15 years 6 months ago
1998
Springer
Abstract. We investigate and compare four variants of the doublepushout approach to graph transformation. Besides the traditional approach with arbitrary matching and injective rig...
108
Voted
FLAIRS
2000
15 years 3 months ago
2000
Hierarchical conceptual clustering has been proven to be a useful data mining technique. Graph-based representation of structural information has been shown to be successful in kn...