1550 search results - page 92 / 310 » Benchmarking for Graph Transformation |
144
click to vote
SYNASC
2008
IEEE
15 years 9 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 ...
102
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...
125
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...
146
click to vote
AGTIVE
2007
Springer
15 years 9 months ago
2007
Springer
In this article, we propose to use the Discrete EVent system Specification (DEVS) formalism to describe and execute graph transformation control structures. We provide a short rev...
130
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...