Sciweavers

598 search results - page 76 / 120
» A random graph model for massive graphs
Sort
View
ICPR
2010
IEEE
15 years 2 months ago
Topic-Sensitive Tag Ranking
Social tagging is an increasingly popular way to describe and classify documents on the web. However, the quality of the tags varies considerably since the tags are authored freel...
Yan'An Jin, Ruixuan Li, Zhengding Lu, Kunmei Wen, ...
MASCOTS
2003
15 years 1 months ago
Toward Scaling Network Emulation using Topology Partitioning
Scalability is the primary challenge to studying large complex network systems with network emulation. This paper studies topology partitioning, assigning disjoint pieces of the n...
Ken Yocum, Ethan Eade, Julius Degesys, David Becke...
INFOCOM
2009
IEEE
15 years 6 months ago
Absence of Evidence as Evidence of Absence: A Simple Mechanism for Scalable P2P Search
Abstract—We propose a novel search mechanism for unstructured p2p networks, and show that it is both scalable, i.e., it leads to a bounded query traffic load per peer as the pee...
Stratis Ioannidis, Peter Marbach
CORR
2011
Springer
159views Education» more  CORR 2011»
14 years 6 months ago
How to Play Unique Games against a Semi-Random Adversary
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
Alexandra Kolla, Konstantin Makarychev, Yury Makar...
WAW
2009
Springer
147views Algorithms» more  WAW 2009»
15 years 6 months ago
A Dynamic Model for On-Line Social Networks
We present a deterministic model for on-line social networks based on transitivity and local knowledge in social interactions. In the Iterated Local Transitivity (ILT) model, at ea...
Anthony Bonato, Noor Hadi, Paul Horn, Pawel Pralat...