Sciweavers

3247 search results - page 101 / 650
» Randomized smoothing networks
Sort
View
APPROX
2010
Springer
179views Algorithms» more  APPROX 2010»
15 years 5 months ago
Rumor Spreading on Random Regular Graphs and Expanders
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...
Nikolaos Fountoulakis, Konstantinos Panagiotou
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
16 years 4 months ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni
MOBICOM
2004
ACM
15 years 9 months ago
Revisiting the TTL-based controlled flooding search: optimality and randomization
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large network. Applications of this problem include searching fo...
Nicholas B. Chang, Mingyan Liu
TC
2008
15 years 3 months ago
A More Realistic Thinning Scheme for Call Admission Control in Multimedia Wireless Networks
A call admission control scheme named thinning scheme, which smoothly throttles the admission rates of calls according to their priorities and aims to provide multiple prioritized ...
Xian Wang, Pingzhi Fan, Yi Pan
INFOCOM
2000
IEEE
15 years 8 months ago
Analytic Evaluation of RED Performance
— End-to-end congestion control mechanisms such as those in TCP are not enough to prevent congestion collapse in the Internet (for starters, not all applications might be willing...
Thomas Bonald, Martin May, Jean-Chrysostome Bolot