1511 search results - page 139 / 303 » Hierarchical Graph Transformation |
150
click to vote
DGCI
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We recently introduced the watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, we propose a new thinning paradigm to compute them. More precisel...
132
click to vote
DCC
2008
IEEE
16 years 4 months ago
2008
IEEE
The name `graph state' is used to describe a certain class of pure quantum state which models a physical structure on which one can perform measurement-based quantum computin...
129
Voted
MFCS
2007
Springer
15 years 11 months ago
2007
Springer
Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is possible to transform α into β by recolouring...
132
click to vote
DCC
2000
IEEE
15 years 9 months ago
2000
IEEE
We introduce a new image compression algorithm that allows progressive image reconstruction – both in resolution and in fidelity, with a fully embedded bitstream. The algorithm ...
251
click to vote
VLDB
2007
ACM
16 years 5 months ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...