3008 search results - page 239 / 602 » Independence in connected graphs |
161
click to vote
FLAIRS
2007
15 years 9 months ago
2007
We deal with the search process of the GraphPlan algorithm in this paper. We concentrate on a problem of finding supports for a sub-goal which arises during the search. We model t...
205
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We propose a new approach to the analysis of Loopy Belief Propagation (LBP) by establishing a formula that connects the Hessian of the Bethe free energy with the edge zeta functio...
156
click to vote
JGAA
2006
15 years 6 months ago
2006
Let G = (V, E) be a graph with n vertices and let P be a set of n points in the plane. We show that deciding whether there is a planar straight-line embedding of G such that the v...
172
click to vote
IPL
2011
15 years 1 months ago
2011
In this paper, we use the concept of edge-colored graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirement...
201
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
We present a polytope-kernel density estimation (PKDE) methodology that allows us to perform exact mean-shift updates along the edges of the Delaunay graph of the data. We discuss...