3708 search results - page 4 / 742 » Approximating Betweenness Centrality |
WDAG
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
MOBIHOC
2002
ACM
14 years 5 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
ICASSP
2011
IEEE
12 years 10 months ago
2011
IEEE
The purpose of this paper is to develop parameter transformation strategies that improve the accuracy of the Variational Bayes (VB) approximation. The idea is to find a transform...
FAW
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. Closeness centrality is an important concept in social network analysis. In a graph representing a social network, closeness centrality measures how close a vertex is to ...
SAB
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. In this paper we study distributed online learning of locomotion gaits for modular robots. The learning is based on a stochastic approximation method, SPSA, which optimiz...