209 search results - page 9 / 42 » Computing a Diameter-Constrained Minimum Spanning Tree in Pa... |
PODC
1997
ACM
15 years 1 months ago
1997
ACM
3DPVT
2006
IEEE
15 years 3 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 ...
DEXA
2010
Springer
14 years 9 months ago
2010
Springer
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
SAC
2003
ACM
15 years 2 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
IFIP
2004
Springer
15 years 2 months ago
2004
Springer
We develop an external memory algorithm for computing minimum spanning trees. The algorithm is considerably simpler than previously known external memory algorithms for this proble...