1357 search results - page 129 / 272 » Compositionality in Graph Transformation |
127
click to vote
SAC
2009
ACM
15 years 10 months ago
2009
ACM
We formalize paper fold (origami) by graph rewriting. Origami construction is abstractly described by a rewriting sys), where O is the set of abstract origami’s and ary relation...
132
Voted
IJCAI
2003
15 years 5 months ago
2003
We examine the approach of encoding planning problems as CSPs more closely. First we present a simple CSP encoding for planning problems and then a set of transformations that can...
168
Voted
TIP
2011
14 years 10 months ago
2011
Abstract—The purpose of this study is to investigate multiregion graph cut image partitioning via kernel mapping of the image data. The image data is transformed implicitly by a ...
125
click to vote
AAIM
2009
Springer
15 years 10 months ago
2009
Springer
We introduce the s-Plex Editing problem generalizing the well-studied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead o...
131
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
—One of the most common types of functions in mathematics, physics, and engineering is a sum of products, sometimes called a partition function. After “normalization,” a sum ...