779 search results - page 108 / 156 » Algorithms for the Sample Mean of Graphs |
125
click to vote
STOC
2001
ACM
16 years 4 months ago
2001
ACM
We show that we can maintain up to polylogarithmic edge connectivity for a fully-dynamic graph in ~O(pn) time per edge insertion or deletion. Within logarithmic factors, this matc...
152
click to vote
CIAC
2010
Springer
16 years 1 months ago
2010
Springer
In this paper we consider a natural generalization of the well-known Max Leaf
Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as
input an undirected co...
127
click to vote
ICRA
2009
IEEE
15 years 11 months ago
2009
IEEE
— Shape is one of the useful information for object detection. The human visual system can often recognize objects based on the 2-D outline shape alone. In this paper, we address...
146
click to vote
MCAM
2007
Springer
15 years 10 months ago
2007
Springer
A three-level method is proposed to achieve robust and real-time ball tracking in soccer videos. It includes object-, intra-trajectory-, and intertrajectory-level processing. Due t...
143
click to vote
3DOR
2009
15 years 2 months ago
2009
Terrestrial laser scanners capture 3D geometry as a point cloud. This paper reports on a new algorithm aiming at the skeletonisation of a laser scanner point cloud, representing a...