Sciweavers

9 search results - page 1 / 2
» Fast centrality approximation in modular networks
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ò
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, ...
PERCOM
2010
ACM
13 years 3 months ago
Gateway designation for timely communications in instant mesh networks
In this paper, we explore how to effectively create and use "instant mesh networks", i.e., wireless mesh networks that are dynamically deployed in temporary circumstances...
Bo Xing, Mayur Deshpande, Sharad Mehrotra, Nalini ...
IPPS
2008
IEEE
13 years 11 months ago
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
David A. Bader, Kamesh Madduri
EDBT
2010
ACM
246views Database» more  EDBT 2010»
13 years 11 months ago
Fast computation of SimRank for static and dynamic information networks
Information networks are ubiquitous in many applications and analysis on such networks has attracted significant attention in the academic communities. One of the most important ...
Cuiping Li, Jiawei Han, Guoming He, Xin Jin, Yizho...