105 search results - page 8 / 21 » A 3-Approximation for the Minimum Tree Spanning k Vertices |
FOCS
1992
IEEE
13 years 11 months ago
1992
IEEE
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dyna...
FOCS
1998
IEEE
13 years 12 months ago
1998
IEEE
We consider the parametric minimum spanning tree problem, in which we are given a graph with edge weights that are linear functions of a parameter and wish to compute the sequenc...
ICIP
2000
IEEE
14 years 9 months ago
2000
IEEE
Registration is a fundamental task in image processing and quite a few registration techniques have been developed in various fields. In this paper we propose a novel graphreprese...
3DPVT
2006
IEEE
14 years 1 months ago
2006
IEEE
The extrinsic camera parameters from video stream images can be accurately estimated by tracking features through the image sequence and using these features to compute parameter ...
DM
2006
13 years 7 months ago
2006
An L(h, k)-labeling of a graph G is an integer labeling of vertices of G, such that adjacent vertices have labels which differ by at least h, and vertices at distance two have lab...