Sciweavers

1591 search results - page 230 / 319
» Random lifts of graphs
Sort
View
ACMSE
2006
ACM
15 years 10 months ago
Discovering communities in complex networks
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely rela...
Hemant Balakrishnan, Narsingh Deo
VALUETOOLS
2006
ACM
176views Hardware» more  VALUETOOLS 2006»
15 years 10 months ago
How to solve large scale deterministic games with mean payoff by policy iteration
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
Vishesh Dhingra, Stephane Gaubert
VALUETOOLS
2006
ACM
107views Hardware» more  VALUETOOLS 2006»
15 years 10 months ago
Thresholds for virus spread on networks
We study how the spread of computer viruses, worms, and other self-replicating malware is affected by the logical topology of the network over which they propagate. We consider a...
Moez Draief, Ayalvadi J. Ganesh, Laurent Massouli&...
ICPADS
2005
IEEE
15 years 10 months ago
On the Connectedness of Peer-to-Peer Overlay Networks
Peer-to-Peer (P2P) applications typically use overlay networks to forward the content queries. However, due to the distributed fashion of the overlay establishment, the overlay ne...
Weisheng Si, MingChu Li
TAMC
2010
Springer
15 years 9 months ago
Community Structure in Large Complex Networks
In this paper, we establish the definition of community fundamentally different from what was commonly accepted in previous studies, where communities were typically assumed to ...
Liaoruo Wang, John E. Hopcroft