Sciweavers

1153 search results - page 76 / 231
» Reversing graph transformations
Sort
View
DNA
2006
Springer
14 years 1 months ago
Design and Simulation of Self-repairing DNA Lattices
Self-repair is essential to all living systems, providing the ability to remain functional in spite of gradual damage. In the context of self-assembly of self-repairing synthetic b...
Urmi Majumder, Sudheer Sahu, Thomas H. LaBean, Joh...
GG
2004
Springer
14 years 3 months ago
Constraints and Application Conditions: From Graphs to High-Level Structures
Abstract. Graph constraints and application conditions are most important for graph grammars and transformation systems in a large variety of application areas. Although different...
Hartmut Ehrig, Karsten Ehrig, Annegret Habel, Karl...
ASP
2003
Springer
14 years 3 months ago
Using Nested Logic Programs for Answer Set Programming
We present a general method to improve computation of answer sets by analyzing structural properties of normal logic programs. Therefore we use labeled directed graphs associated t...
Thomas Linke
CGF
2008
98views more  CGF 2008»
13 years 10 months ago
Surface Reconstruction from Unorganized Point Data with Quadrics
We present a reverse engineering method for constructing a surface approximation scheme whose input is a set of unorganized noisy points in space and whose output is a set of quad...
Marek Vanco, Bernd Hamann, Guido Brunnett
IPL
2008
82views more  IPL 2008»
13 years 10 months ago
On fully orientability of 2-degenerate graphs
Suppose that D is an acyclic orientation of the graph G. An arc of D is dependent if its reversal creates a directed cycle. Let d(D) denote the number of dependent arcs in D. Defi...
Hsin-Hao Lai, Gerard J. Chang, Ko-Wei Lih