Sciweavers

90 search results - page 4 / 18
» Hybrid Overlay Structure Based on Random Walks
Sort
View
ISCIS
2005
Springer
14 years 1 months ago
Computing Communities in Large Networks Using Random Walks
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...
Pascal Pons, Matthieu Latapy
GCC
2005
Springer
14 years 1 months ago
Exploiting the Heterogeneity in Structured Peer-to-Peer Systems
The structured peer-to-peer system, which is based on the distributed hash table, offers an administration-free and fault-tolerant application-level overlay network. However, a ra...
Tongqing Qiu, Guihai Chen
ICMCS
2008
IEEE
150views Multimedia» more  ICMCS 2008»
14 years 2 months ago
DONet-VoD: A hybrid overlay solution for efficient peer-to-peer video on demand services
The existing DONet-based approach uses successfully a random gossip algorithm for scalable live video streaming. This pure mesh overlay network-based solution may lead to unaccept...
Changqiao Xu, Gabriel-Miro Muntean, Enda Fallon, X...
AAAI
2008
13 years 10 months ago
Clustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Mo Chen, Jianzhuang Liu, Xiaoou Tang
TPDS
2008
116views more  TPDS 2008»
13 years 7 months ago
A Dynamic Skip List-Based Overlay for On-Demand Media Streaming with VCR Interactions
Media distribution through application-layer overlay networks has received considerable attention recently, owing to its flexible and readily deployable nature. On-demand streaming...
Dan Wang, Jiangchuan Liu