1153 search results - page 134 / 231 » Reversing graph transformations |
138
Voted
LATA
2009
Springer
15 years 9 months ago
2009
Springer
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
132
Voted
JGAA
2002
15 years 2 months ago
2002
We address in this paper the problem of constructing embeddings of planar graphs satisfying declarative, user-defined topological constraints. The constraints consist each of a cy...
122
Voted
SCAM
2006
IEEE
15 years 8 months ago
2006
IEEE
Programmers often want to transform the source or binary representations of their programs (e.g., to optimize, add dynamic safety checks, or add profile gathering code). Unfortun...
130
Voted
ICCV
2005
IEEE
15 years 8 months ago
2005
IEEE
When an image is viewed at varying resolutions, it is known to create discrete perceptual jumps or transitions amid the continuous intensity changes. In this paper, we study a per...
138
Voted
ICPR
2008
IEEE
16 years 3 months ago
2008
IEEE
In this paper, we propose a method of object recognition and segmentation using Scale-Invariant Feature Transform (SIFT) and Graph Cuts. SIFT feature is invariant for rotations, s...