76 search results - page 13 / 16 » Minimum Spanning Tree on Spatio-Temporal Networks |
MOBIHOC
2002
ACM
14 years 8 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...
PERCOM
2006
ACM
14 years 8 months ago
2006
ACM
Although it is commonly assumed that the use of topology control can improve the throughput capacity of wireless networks, analytical results on this topic are sometimes contradic...
ICPP
2005
IEEE
14 years 2 months ago
2005
IEEE
In wireless ad hoc networks, clustering is one of the most important approaches for many applications. A connected k-hop clustering network is formed by electing clusterheads in k...
ICDE
2010
IEEE
14 years 8 months ago
2010
IEEE
The increasing popularity of social networks has initiated a fertile research area in information extraction and data mining. Although such analysis can facilitate better understan...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
In the classic multi-armed bandits problem, the goal is to have a policy for dynamically operating arms that each yield stochastic rewards with unknown means. The key metric of int...