Sciweavers

866 search results - page 78 / 174
» Bidirectionalizing graph transformations
Sort
View
WOSP
2005
ACM
15 years 3 months ago
From UML to LQN by XML algebra-based model transformations
The change of focus from code to models promoted by OMG's Model Driven Development raises the need for verification of nonfunctional characteristics of UML models, such as pe...
Gordon Ping Gu, Dorina C. Petriu
ENTCS
2008
88views more  ENTCS 2008»
14 years 10 months ago
Behavior-Preserving Simulation-to-Animation Model and Rule Transformations
In the framework of graph transformation, simulation rules define the operational behavior of visual models. Moreover, it has been shown already how to construct animation rules f...
Claudia Ermel, Hartmut Ehrig
CVIU
2004
134views more  CVIU 2004»
14 years 9 months ago
The "dead reckoning" signed distance transform
Consider a binary image containing one or more objects. A signed distance transform assigns to each pixel (voxel, etc.), both inside and outside of any objects, the minimum distan...
George J. Grevera
WEA
2007
Springer
111views Algorithms» more  WEA 2007»
15 years 4 months ago
Vertex Cover Approximations on Random Graphs
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...
Eyjolfur Asgeirsson, Clifford Stein
DLT
2004
14 years 11 months ago
Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey
New results on the recognizability of sets of finite graphs, hypergraphs and relational structures are presented. The general framework of this research which associates tightly a...
Bruno Courcelle