684 search results - page 51 / 137 » On embedding well-separable graphs |
130
click to vote
GD
2007
Springer
15 years 10 months ago
2007
Springer
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is m...
149
click to vote
WADS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We introduce the simultaneous representation problem, defined for any graph class C characterized in terms of representations, e.g. any class of intersection graphs. Two...
162
click to vote
NIPS
2007
15 years 5 months ago
2007
We consider the estimation problem in Gaussian graphical models with arbitrary structure. We analyze the Embedded Trees algorithm, which solves a sequence of problems on tractable...
154
click to vote
IFM
2010
Springer
15 years 2 months ago
2010
Springer
This paper presents initial results of research aimed at developing methods and tools for multidisciplinary collaborative development of dependable embedded systems. We focus on th...
122
click to vote
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
One of the major limitations of HMM-based models is the inability to cope with topology: When applied to a visible observation (VO) sequence, HMM-based techniques have difficulty ...