Sciweavers

415 search results - page 22 / 83
» Discovering communities in complex networks
Sort
View
TKDE
2012
250views Formal Methods» more  TKDE 2012»
11 years 10 months ago
Dense Subgraph Extraction with Application to Community Detection
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
Jie Chen 0007, Yousef Saad
ICRA
2007
IEEE
151views Robotics» more  ICRA 2007»
14 years 2 months ago
A Spatially Structured Genetic Algorithm over Complex Networks for Mobile Robot Localisation
— One of the most important problems in Mobile Robotics is to realise the complete robot’s autonomy. In order to achieve this goal several tasks have to be accomplished. Among ...
Andrea Gasparri, Stefano Panzieri, Federica Pascuc...
TRIDENTCOM
2010
IEEE
13 years 6 months ago
G-Lab Deep: Cross-Layer Composition and Security for a Flexible Future Internet
The Internet enables the way how global businesses and communities communicate today. In the last years, however, new demands have collided with old designs, resulting in a complex...
Carsten Schmoll, Christian Henke, Dirk Hoffstadt, ...
MP
2006
101views more  MP 2006»
13 years 8 months ago
Robust optimization of contaminant sensor placement for community water systems
We present a series of related robust optimization models for placing sensors in municipal water networks to detect contaminants that are maliciously or accidentally injected. We f...
Robert D. Carr, Harvey J. Greenberg, William E. Ha...
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
14 years 8 months ago
Constant-factor approximation algorithms for identifying dynamic communities
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf