335 search results - page 10 / 67 » How to Use Spanning Trees to Navigate in Graphs |
3DPVT
2006
IEEE
15 years 5 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 ...
105
click to vote
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
APPROX
2004
Springer
15 years 5 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
115
click to vote
INFOVIS
2003
IEEE
15 years 5 months ago
2003
IEEE
Network evolution is a ubiquitous phenomenon in a wide variety of complex systems. There is an increasing interest in statistically modeling the evolution of complex networks such...
115
click to vote
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
We present a polytope-kernel density estimation (PKDE) methodology that allows us to perform exact mean-shift updates along the edges of the Delaunay graph of the data. We discuss...