Sciweavers

2084 search results - page 350 / 417
» Proving Time Bounds for Randomized Distributed Algorithms
Sort
View
WAOA
2005
Springer
92views Algorithms» more  WAOA 2005»
15 years 3 months ago
The Conference Call Search Problem in Wireless Networks
Cellular telephony systems, where locations of mobile users are unknown at some times, are becoming more common. In such systems, mobile users are roaming in a zone and a user repo...
Leah Epstein, Asaf Levin
ESA
2005
Springer
107views Algorithms» more  ESA 2005»
15 years 3 months ago
Workload-Optimal Histograms on Streams
Histograms are used in many ways in conventional databases and in data stream processing for summarizing massive data distributions. Previous work on constructing histograms on da...
S. Muthukrishnan, Martin Strauss, X. Zheng
KDD
2007
ACM
191views Data Mining» more  KDD 2007»
15 years 10 months ago
Cost-effective outbreak detection in networks
Given a water distribution network, where should we place sensors to quickly detect contaminants? Or, which blogs should we read to avoid missing important stories? These seemingl...
Andreas Krause, Carlos Guestrin, Christos Faloutso...
DIALM
2010
ACM
194views Algorithms» more  DIALM 2010»
14 years 7 months ago
Prioritized gossip in vehicular networks
We present a method for using real world mobility traces to identify tractable theoretical models for the study of distributed algorithms in mobile networks. We validate the metho...
Alejandro Cornejo, Calvin C. Newport
IJAHUC
2006
128views more  IJAHUC 2006»
14 years 9 months ago
Avoid 'void' in geographic routing for data aggregation in sensor networks
: Wireless sensor networks have attracted great attention in research and industrial development due to its fast-growing application potentials. New techniques must be developed fo...
Shigang Chen, Guangbin Fan, Jun-Hong Cui