Sciweavers

1075 search results - page 109 / 215
» Communities Detection in Large Networks
Sort
View
MSWIM
2006
ACM
15 years 3 months ago
The power of choice in random walks: an empirical study
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
Chen Avin, Bhaskar Krishnamachari
AAIM
2007
Springer
118views Algorithms» more  AAIM 2007»
15 years 1 months ago
Significance-Driven Graph Clustering
Abstract. Modularity, the recently defined quality measure for clusterings, has attained instant popularity in the fields of social and natural sciences. We revisit the rationale b...
Marco Gaertler, Robert Görke, Dorothea Wagner
IMC
2006
ACM
15 years 3 months ago
Shared-state sampling
We present an algorithm, Shared-State Sampling (S3 ), for the problem of detecting large flows in high-speed networks. While devised with different principles in mind, S3 turns ...
Frederic Raspall, Sebastià Sallent, Josep Y...
INFOCOM
2006
IEEE
15 years 3 months ago
MIND: A Distributed Multi-Dimensional Indexing System for Network Diagnosis
— Detecting coordinated attacks on Internet resources requires a distributed network monitoring infrastructure. Such an infrastructure will have two logically distinct elements: ...
Xin Li, Fang Bian, Hui Zhang 0002, Christophe Diot...
INFOSCALE
2006
ACM
15 years 3 months ago
Simulating non-scanning worms on peer-to-peer networks
Millions of Internet users are using large-scale peerto-peer (P2P) networks to share content files today. Many other mission-critical applications, such as Internet telephony and...
Guanling Chen, Robert S. Gray