866 search results - page 70 / 174 » Bidirectionalizing graph transformations |
115
Voted
GG
2004
Springer
15 years 8 months ago
2004
Springer
We show how edge-labelled graphs can be used to represent first-order logic formulae. This gives rise to recursively nested structures, in which each level of nesting corresponds ...
91
Voted
BIRTHDAY
2005
Springer
15 years 8 months ago
2005
Springer
In the double-pushout approach to graph transformations, most authors assume the left-hand side to be injective, since the noninjective case leads to ambiguous results. Taking into...
148
Voted
HIPEAC
2010
Springer
15 years 24 days ago
2010
Springer
Abstract. Stream programming is a promising way to expose concurrency to the compiler. A stream program is built from kernels that communicate only via point-to-point streams. The ...
136
Voted
JMLR
2010
14 years 9 months ago
2010
In this paper we address the problem of predicting when the available data is incomplete. We show that changing the generally accepted table-wise view of the sample items into a g...
122
click to vote
MST
2010
14 years 9 months ago
2010
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...