Sciweavers

364 search results - page 17 / 73
» Computing Communities in Large Networks Using Random Walks
Sort
View
SIGCOMM
2012
ACM
12 years 12 months ago
AutoNetkit: simplifying large scale, open-source network experimentation
We present a methodology that brings simplicity to large and comt labs by using abstraction. The networking community has appreciated the value of large scale test labs to explore...
Simon Knight, Askar Jaboldinov, Olaf Maennel, Iain...
79
Voted
MIDDLEWARE
2005
Springer
15 years 2 months ago
An Optimal Overlay Topology for Routing Peer-to-Peer Searches
Unstructured peer-to-peer networks are frequently used as the overlay in various middleware toolkits for emerging applications, from content discovery to query result caching to di...
Brian F. Cooper
ICML
2006
IEEE
15 years 10 months ago
Fast direct policy evaluation using multiscale analysis of Markov diffusion processes
Policy evaluation is a critical step in the approximate solution of large Markov decision processes (MDPs), typically requiring O(|S|3 ) to directly solve the Bellman system of |S...
Mauro Maggioni, Sridhar Mahadevan
SIGMETRICS
2008
ACM
131views Hardware» more  SIGMETRICS 2008»
14 years 9 months ago
On the design of hybrid peer-to-peer systems
In this paper, we consider hybrid peer-to-peer systems where users form an unstructured peer-to-peer network with the purpose of assisting a server in the distribution of data. We...
Stratis Ioannidis, Peter Marbach
CIKM
2008
Springer
14 years 11 months ago
Characterizing and predicting community members from evolutionary and heterogeneous networks
Mining different types of communities from web data have attracted a lot of research efforts in recent years. However, none of the existing community mining techniques has taken i...
Qiankun Zhao, Sourav S. Bhowmick, Xin Zheng, Kai Y...