441 search results - page 17 / 89 » Convex Graph Invariants |
JCT
2008
13 years 7 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...
DM
2010
13 years 7 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...
CVPR
2005
IEEE
14 years 9 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 ...
3DPVT
2006
IEEE
14 years 1 months ago
2006
IEEE
ICIAR
2010
Springer
13 years 9 months ago
2010
Springer