Sciweavers

1153 search results - page 17 / 231
» Reversing graph transformations
Sort
View
MODELS
2009
Springer
14 years 2 months ago
Towards Composite Model Transformations Using Distributed Graph Transformation Concepts
Model-based development of highly complex software systems leads to large models. Storing them in repositories offers the possibility to work with these models in a distributed env...
Stefan Jurack, Gabriele Taentzer
SPAA
2005
ACM
14 years 1 months ago
Peer-to-peer networks based on random transformations of connected regular undirected graphs
We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k +2 edges it interchanges the end vertices of the path. By defin...
Peter Mahlmann, Christian Schindelhauer
SIBGRAPI
2007
IEEE
14 years 1 months ago
Improved Reversible Mapping from Color to Gray
— In the reversible conversion of color images to gray ones, colors are mapped to textures and from the textures the receiver can recover the colors, i.e. one may print a color i...
Ricardo L. de Queiroz
PRL
2010
112views more  PRL 2010»
13 years 6 months ago
Reversible color-to-gray mapping using subband domain texturization
— The concept of reversible conversion of color images to gray ones has been recently introduced. Colors are mapped to textures and from the textures the receiver can recover the...
Ricardo L. de Queiroz
ITNG
2007
IEEE
14 years 1 months ago
Sorting by Block-Interchanges and Signed Reversals
A block-interchange is a rearrangement event that exchanges two, not necessarily consecutive, contiguous regions in a genome, maintaining the original orientation. Signed reversal...
Cleber V. G. Mira, Joao Meidanis