1153 search results - page 126 / 231 » Reversing graph transformations |
130
Voted
PEPM
2007
ACM
15 years 9 months ago
2007
ACM
XML graphs have shown to be a simple and effective formalism for representing sets of XML documents in program analysis. It has evolved through a six year period with variants tai...
136
click to vote
ICMCS
2005
IEEE
15 years 9 months ago
2005
IEEE
This paper proposes employing a graph-theoretic approach to estimate the region correspondence between two images. We represent each image as an attributed undirected graph and tr...
167
Voted
EMMCVPR
2005
Springer
15 years 9 months ago
2005
Springer
We consider the use of medial surfaces to represent symmetries of cts. This allows for a qualitative abstraction based on a directed acyclic graph of components and also a degree o...
127
Voted
ARSCOM
2002
15 years 3 months ago
2002
Given a non-planar graph G with a subdivision of K5 as a subgraph, we can either transform the K5-subdivision into a K3,3-subdivision if it is possible, or else we obtain a partit...
149
Voted
AGTIVE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Business process models describe workflows by a set of actions together with their ordering. When implementing business processes within a service-oriented architecture,...