1357 search results - page 114 / 272 » Compositionality in Graph Transformation |
251
click to vote
PODS
2004
ACM
16 years 3 months ago
2004
ACM
A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the...
145
Voted
SYNASC
2008
IEEE
15 years 10 months ago
2008
IEEE
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...
104
click to vote
IH
2007
Springer
15 years 9 months ago
2007
Springer
We present a probabilistic program-transformation algorithm to render a given program tamper-resistant. In addition, we suggest a model to estimate the required effort for an atta...
126
click to vote
KR
1994
Springer
15 years 7 months ago
1994
Springer
Probabilistic AI planning methods that minimize expected execution cost have a neutral attitude towards risk. We demonstrate how one can transform planning problems for risk-sensi...
131
click to vote
CVPR
2007
IEEE
16 years 5 months ago
2007
IEEE
Many vision tasks are posed as either graph partitioning (coloring) or graph matching (correspondence) problems. The former include segmentation and grouping, and the latter inclu...