Sciweavers

21 search results - page 1 / 5
» Fast unfolding of community hierarchies in large networks
Sort
View
CORR
2008
Springer
76views Education» more  CORR 2008»
13 years 4 months ago
Fast unfolding of community hierarchies in large networks
Vincent D. Blondel, Jean-Loup Guillaume, Renaud La...
TPDS
2010
136views more  TPDS 2010»
13 years 2 months ago
Gossip-Based Self-Management of a Recursive Area Hierarchy for Large Wireless SensorNets
—A recursive multi-hop area hierarchy has a number of applications in wireless sensor networks, the most common being scalable point-to-point routing, so-called hierarchical rout...
Konrad Iwanicki, Maarten van Steen
DSN
2004
IEEE
13 years 8 months ago
Support for Mobility and Fault Tolerance in Mykil
This paper describes the support provided for mobility and fault tolerance in Mykil, which is a key distribution protocol for large, secure group multicast. Mykil is based on a com...
Jyh-How Huang, Shivakant Mishra
EDBT
2009
ACM
164views Database» more  EDBT 2009»
13 years 9 months ago
Fast object search on road networks
In this paper, we present ROAD, a general framework to evaluate Location-Dependent Spatial Queries (LDSQ)s that searches for spatial objects on road networks. By exploiting search...
Ken C. K. Lee, Wang-Chien Lee, Baihua Zheng
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
14 years 5 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...