13 search results - page 3 / 3 » Two Linear-Time Algorithms for Computing the Minimum Length ... |
MOBIHOC
2002
ACM
14 years 4 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...
MOBIHOC
2008
ACM
14 years 4 months ago
2008
ACM
In many emerging applications, data streams are monitored in a network environment. Due to limited communication bandwidth and other resource constraints, a critical and practical...
CIVR
2007
Springer
13 years 11 months ago
2007
Springer
We present a novel matching and similarity evaluation method for planar geometric shapes represented by sets of polygonal curves. Given two shapes, the matching algorithm randomly...