618 search results - page 14 / 124 » Short cycle connectivity |
CORR
2007
Springer
13 years 9 months ago
2007
Springer
— Max-product belief propagation is a local, iterative algorithm to find the mode/MAP estimate of a probability distribution. While it has been successfully employed in a wide v...
CPC
2010
13 years 7 months ago
2010
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...
ETT
2006
13 years 9 months ago
2006
The Drive-thru Internet architecture allows exploiting intermittent connectivity by temporarily connecting to IEEE 802.11 WLAN access points at the roadside from moving vehicles. T...
DM
2008
13 years 9 months ago
2008
One of the basic results in graph theory is Dirac's theorem, that every graph of order n 3 and minimum degree n/2 is Hamiltonian. This may be restated as: if a graph of ord...
ICPR
2010
IEEE
13 years 7 months ago
2010
IEEE
We present a method for object tracking over time sequence imagery. The image plane is represented with a 4-connected planar graph where vertices are associated with pixels. On ea...