Sciweavers

1153 search results - page 137 / 231
» Reversing graph transformations
Sort
View
RTA
2007
Springer
14 years 5 months ago
Adjunction for Garbage Collection with Application to Graph Rewriting
We investigate garbage collection of unreachable parts of rooted graphs from a categorical point of view. First, we define this task as the right adjoint of an inclusion functor. ...
Dominique Duval, Rachid Echahed, Fréd&eacut...
SCIA
2007
Springer
119views Image Analysis» more  SCIA 2007»
14 years 5 months ago
Watertight Multi-view Reconstruction Based on Volumetric Graph-Cuts
This paper proposes a fast 3D reconstruction approach for efficiently generating watertight 3D models from multiple short baseline views. Our method is based on the combination of...
Mario Sormann, Christopher Zach, Joachim Bauer, Ko...
GG
2004
Springer
14 years 4 months ago
Extending Graph Rewriting for Refactoring
Refactorings are transformations that change the structure of a program, while preserving the behavior. The topic has attracted a lot of attention recently, since it is a promising...
Niels Van Eetvelde, Dirk Janssens
ICBA
2004
Springer
271views Biometrics» more  ICBA 2004»
14 years 4 months ago
Enhance the Alignment Accuracy of Active Shape Models Using Elastic Graph Matching
Active Shape Model (ASM) is one of the most popular methods for image alignment. To improve its matching accuracy, in this paper, ASM searching method is combined with a simplifie...
Sanqiang Zhao, Wen Gao, Shiguang Shan, Baocai Yin
DAC
2009
ACM
14 years 3 months ago
Reduction techniques for synchronous dataflow graphs
The Synchronous Dataflow (SDF) model of computation is popular for modelling the timing behaviour of real-time embedded hardware and software systems and applications. It is an es...
Marc Geilen