Sciweavers

733 search results - page 106 / 147
» Recommending random walks
Sort
View
INFOCOM
2010
IEEE
15 years 12 days ago
On Delay Constrained Multicast Capacity of Large-Scale Mobile Ad-Hoc Networks
—This paper studies the delay constrained multicast capacity of large scale mobile ad hoc networks (MANETs). We consider a MANET that consists of ns multicast sessions. Each mult...
Shan Zhou, Lei Ying
TON
2010
83views more  TON 2010»
15 years 9 days ago
Understanding and modeling the internet topology: economics and evolution perspective
Abstract—In this paper, we seek to understand the intrinsic reasons for the well-known phenomenon of heavy-tailed degree in the Internet AS graph and argue that in contrast to tr...
Xiaoming Wang, Dmitri Loguinov
ICMCS
2009
IEEE
131views Multimedia» more  ICMCS 2009»
14 years 11 months ago
Web image mining using concept sensitive Markov stationary features
With the explosive growth of web resources, how to mine semantically relevant images efficiently becomes a challenging and necessary task. In this paper, we propose a concept sens...
Chunjie Zhang, Jing Liu, Hanqing Lu, Songde Ma
TIT
2010
146views Education» more  TIT 2010»
14 years 8 months ago
Information propagation speed in mobile and delay tolerant networks
Abstract--The goal of this paper is to increase our understanding of the fundamental performance limits of mobile and Delay Tolerant Networks (DTNs), where end-to-end multi-hop pat...
Philippe Jacquet, Bernard Mans, Georgios Rodolakis
APPROX
2010
Springer
213views Algorithms» more  APPROX 2010»
15 years 3 months ago
Constructive Proofs of Concentration Bounds
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
Russell Impagliazzo, Valentine Kabanets