163 search results - page 21 / 33 » Unifying Two Graph Decompositions with Modular Decomposition |
102
Voted
ECCV
2004
Springer
16 years 1 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...
94
Voted
COCO
2010
Springer
15 years 3 months 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...
89
Voted
COMBINATORICA
2008
14 years 11 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...
92
Voted
JMLR
2008
14 years 11 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...
112
Voted
ECBS
2009
IEEE
14 years 9 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...