205 search results - page 33 / 41 » Grid Graph Reachability Problems |
121
Voted
ARSCOM
2007
15 years 5 months ago
2007
A subset D of the vertex set V of a graph is called an open oddd dominating set if each vertex in V is adjacent to an odd number of vertices in D (adjacency is irreflexive). In t...
132
click to vote
NIPS
2004
15 years 6 months ago
2004
We propose a novel a framework for deriving approximations for intractable probabilistic models. This framework is based on a free energy (negative log marginal likelihood) and ca...
136
click to vote
IPPS
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract— The use of many distributed, heterogeneous resources as a large collective platform offers great potential. A key issue for these grid platforms is middleware scalabili...
135
click to vote
ICCV
2007
IEEE
16 years 6 months ago
2007
IEEE
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
144
Voted
CORR
2011
Springer
14 years 12 months ago
2011
Springer
Abstract. Consider a weighted and undirected graph, possibly with self-loops, and its corresponding Laplacian matrix, possibly augmented with additional diagonal elements correspon...