6413 search results - page 40 / 1283 » Classes of cycle bases |
114
Voted
EJC
2008
14 years 11 months ago
2008
For a graph G and a set D V (G), define Nr[x] = {xi V (G) : d(x, xi) r} (where d(x, y) is graph theoretic distance) and Dr(x) = Nr[x] D. D is known as an r-identifying code if...
102
Voted
ICPR
2010
IEEE
14 years 9 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...
102
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
140
click to vote
Publication
Concern over climate change, traffic congestion, and the health consequences of
sedentary lifestyles has resulted in a surge of interest in cycling as an efficient form of
urban ...
96
Voted
JCT
2010
14 years 11 months ago
2010
In the symmetric group on a set of size 2n, let P2n denote the conjugacy class of involutions with no fixed points (equivalently, we refer to these as “pairings”, since each ...