441 search results - page 17 / 89 » Convex Graph Invariants |
110
click to vote
JCT
2008
15 years 5 months ago
2008
Let be the fundamental group of a finite connected graph G. Let M be an abelian group. A distribution on the boundary of the universal covering tree is an M-valued measure defin...
132
click to vote
DM
2010
15 years 5 months ago
2010
A set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path between two not necessarily distinct vertices in D. The geodetic number of G is the minimu...
125
click to vote
CVPR
2005
IEEE
16 years 7 months ago
2005
IEEE
Illumination changes are a ubiquitous problem in computer vision. They present a challenge in many applications, including tracking: for example, an object may move in and out of ...