Sciweavers

3708 search results - page 4 / 742
» Approximating Betweenness Centrality
Sort
View
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
13 years 4 months ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
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...
Christoph Lenzen, Roger Wattenhofer
MOBIHOC
2002
ACM
14 years 5 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
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...
Yuanzhu Peter Chen, Arthur L. Liestman
ICASSP
2011
IEEE
12 years 10 months ago
The transformed Variational Bayes approximation
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...
Viet Hung Tran, Anthony Quinn
FAW
2008
Springer
104views Algorithms» more  FAW 2008»
13 years 8 months ago
Ranking of Closeness Centrality for Large-Scale Social Networks
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 ...
Kazuya Okamoto, Wei Chen, Xiang-Yang Li
SAB
2010
Springer
226views Optimization» more  SAB 2010»
13 years 4 months ago
Distributed Online Learning of Central Pattern Generators in Modular Robots
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...
David Johan Christensen, Alexander Spröwitz, ...