Sciweavers

1439 search results - page 1 / 288
» Fast approximation of centrality
Sort
View
CIKM
2009
Springer
13 years 9 months ago
Fast centrality approximation in modular networks
Shu Yan Chan, Ian X. Y. Leung, Pietro Liò
SODA
2001
ACM
69views Algorithms» more  SODA 2001»
13 years 6 months ago
Fast approximation of centrality
David Eppstein, Joseph Wang
SAB
2010
Springer
226views Optimization» more  SAB 2010»
13 years 3 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, ...
EUROPAR
2010
Springer
13 years 5 months ago
A Fast 5/2-Approximation Algorithm for Hierarchical Scheduling
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...
Marin Bougeret, Pierre-François Dutot, Klau...
WAW
2007
Springer
144views Algorithms» more  WAW 2007»
13 years 11 months ago
Approximating Betweenness Centrality
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
David A. Bader, Shiva Kintali, Kamesh Madduri, Mil...