163 search results - page 21 / 33 » Unifying Two Graph Decompositions with Modular Decomposition |
ECCV
2004
Springer
14 years 10 months ago
2004
Springer
Among image restoration literature, there are mainly two kinds of approach. One is based on a process over image wavelet coefficients, as wavelet shrinkage for denoising. The other...
COCO
2010
Springer
14 years 12 days ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
COMBINATORICA
2008
13 years 8 months ago
2008
Abstract. We relate signs of edge-colorings (as in classical Penrose's result) with "Pfaffian labelings", a generalization of Pfaffian orientations, whereby edges ar...
JMLR
2008
13 years 8 months ago
2008
In this paper, we propose a recursive method for structural learning of directed acyclic graphs (DAGs), in which a problem of structural learning for a large DAG is first decompos...
ECBS
2009
IEEE
13 years 6 months ago
2009
IEEE
Current domain-specific modeling (DSM) frameworks for designing component-based systems often consider the system's structural and behavioral concerns as the two dominant con...