79 search results - page 14 / 16 » Fast Self-Stabilizing Minimum Spanning Tree Construction |
MOBIHOC
2002
ACM
14 years 5 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
STACS
2001
Springer
13 years 10 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
NIPS
2004
13 years 7 months ago
2004
Many machine learning algorithms for clustering or dimensionality reduction take as input a cloud of points in Euclidean space, and construct a graph with the input data points as...
MOBICOM
1997
ACM
13 years 10 months ago
1997
ACM
We describe a reliable broadcast protocol for mobile multihop packet radio networks. The reliable broadcast service ensures that all the hosts in a group deliver the same set of m...
CVPR
2006
IEEE
14 years 7 months ago
2006
IEEE
We investigate the problem of learning the structure of an articulated object, i.e. its kinematic chain, from feature trajectories under affine projections. We demonstrate this po...