1357 search results - page 118 / 272 » Compositionality in Graph Transformation |
108
Voted
GG
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. Adaptive star grammars generalize well-known graph grammar formalisms based on hyperedge and node replacement while retaining, e.g., parseability and the commutativity an...
138
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...
135
Voted
ICPR
2004
IEEE
16 years 4 months ago
2004
IEEE
Given two or more images, we can define different but related problems on pattern matching such as image registration, pattern detection and localization, and common pattern disco...
113
Voted
ICCS
2005
Springer
15 years 9 months ago
2005
Springer
A main feature of many logics used in computer science is a means to express quantification. Usually, syntactical devices like variables and quantifiers are used for this purpose...
107
Voted
GG
2004
Springer
15 years 9 months ago
2004
Springer
There would seem to be a natural connection between graphs and information security. This is particularly so in the arena of access control and authorization. Research on applying ...