328 search results - page 17 / 66 » Algorithms for the edge-width of an embedded graph |
COCOON
2008
Springer
14 years 11 months ago
2008
Springer
Given a class of graphs, G, a graph G is a probe graph of G if its vertices can be partitioned into two sets, P (the probes) and N (the nonprobes), where N is an independent set, s...
CVPR
2006
IEEE
15 years 11 months ago
2006
IEEE
This paper presents a new volumetric stereo algorithm to reconstruct the 3D shape of an arbitrary object. Our method is based on finding the minimum cut in an octahedral graph str...
HYBRID
2007
Springer
15 years 1 months ago
2007
Springer
We show how Embedded Graph Grammars (EGGs) are used to specify local interaction rules between mobile robots in a natural manner. This formalism allows us to treat local network to...
FCCM
2006
IEEE
15 years 3 months ago
2006
IEEE
— Many important applications are organized around long-lived, irregular sparse graphs (e.g., data and knowledge bases, CAD optimization, numerical problems, simulations). The gr...
PKDD
2009
Springer
15 years 4 months ago
2009
Springer
Existing feature extraction methods explore either global statistical or local geometric information underlying the data. In this paper, we propose a general framework to learn fea...