Sciweavers

3265 search results - page 178 / 653
» Representing Groups on Graphs
Sort
View
SYNASC
2008
IEEE
284views Algorithms» more  SYNASC 2008»
15 years 10 months ago
Graph Rewriting in Computational Origami
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 ...
Tetsuo Ida
IAT
2007
IEEE
15 years 10 months ago
Analysis of Multi-Actor Policy Contexts Using Perception Graphs
Policy making is a multi-actor process: it involves a variety of actors, each trying to further their own interests. How these actors decide and act largely depends on the way the...
Pieter W. G. Bots
ICIAR
2007
Springer
15 years 10 months ago
Parameterless Discrete Regularization on Graphs for Color Image Filtering
A discrete regularization framework on graphs is proposed and studied for color image filtering purposes when images are represented by grid graphs. Image filtering is considered...
Olivier Lezoray, Sébastien Bougleux, Abderr...
PEPM
2007
ACM
15 years 10 months ago
XML graphs in program analysis
XML graphs have shown to be a simple and effective formalism for representing sets of XML documents in program analysis. It has evolved through a six year period with variants tai...
Anders Møller, Michael I. Schwartzbach
WABI
2007
Springer
15 years 10 months ago
A Graph Clustering Approach to Weak Motif Recognition
The aim of the motif recognition problem is to detect a set of mutually similar subsequences within a collection of biological sequences. The weak motif recognition problem on DNA ...
Christina Boucher, Daniel G. Brown, Paul Church