Sciweavers

844 search results - page 133 / 169
» Time-evolving modeling of social networks
Sort
View
EDBT
2012
ACM
228views Database» more  EDBT 2012»
11 years 10 months ago
Finding maximal k-edge-connected subgraphs from a large graph
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
Rui Zhou, Chengfei Liu, Jeffrey Xu Yu, Weifa Liang...
ICDCS
2010
IEEE
13 years 11 months ago
Existence Theorems and Approximation Algorithms for Generalized Network Security Games
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
V. S. Anil Kumar, Rajmohan Rajaraman, Zhifeng Sun,...
KDD
2010
ACM
250views Data Mining» more  KDD 2010»
13 years 9 months ago
On community outliers and their efficient detection in information networks
Linked or networked data are ubiquitous in many applications. Examples include web data or hypertext documents connected via hyperlinks, social networks or user profiles connected...
Jing Gao, Feng Liang, Wei Fan, Chi Wang, Yizhou Su...
CSE
2009
IEEE
14 years 2 months ago
A Network-Aware Distributed Membership Protocol for Collaborative Defense
— To counteract current trends in network malware, distributed solutions have been developed that harness the power of collaborative end-host sensors. While these systems greatly...
David Zage, Carl Livadas, Eve M. Schooler
INFOCOM
2009
IEEE
14 years 2 months ago
A Sybilproof Indirect Reciprocity Mechanism for Peer-to-Peer Networks
Abstract— Although direct reciprocity (Tit-for-Tat) contribution systems have been successful in reducing freeloading in peerto-peer overlays, it has been shown that, unless the ...
Raul Landa, David Griffin, Richard G. Clegg, Eleni...