Sciweavers

360 search results - page 65 / 72
» Distributed Network Querying with Bounded Approximate Cachin...
Sort
View
INFOCOM
2008
IEEE
15 years 3 months ago
Feasible Rate Allocation in Wireless Networks
—Rate allocation is a fundamental problem in the operation of a wireless network because of the necessity to schedule the operation of mutually interfering links between the node...
Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, R...
SODA
2012
ACM
177views Algorithms» more  SODA 2012»
12 years 12 months ago
Stochastic coalescence in logarithmic time
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...
Po-Shen Loh, Eyal Lubetzky
FOCS
2009
IEEE
15 years 4 months ago
Faster Generation of Random Spanning Trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
Jonathan A. Kelner, Aleksander Madry
INFOCOM
2008
IEEE
15 years 3 months ago
HERO: Online Real-Time Vehicle Tracking in Shanghai
—Intelligent transportation systems have become increasingly important for the public transportation in Shanghai. In response, ShanghaiGrid (SG) aims to provide abundant intellig...
Hongzi Zhu, Yanmin Zhu, Minglu Li, Lionel M. Ni
IPSN
2007
Springer
15 years 3 months ago
Hierarchical spatial gossip for multi-resolution representations in sensor networks
In this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates...
Rik Sarkar, Xianjin Zhu, Jie Gao