Sciweavers

388 search results - page 33 / 78
» Robust Lower Bounds for Communication and Stream Computation
Sort
View
INFOCOM
2010
IEEE
15 years 4 months ago
On Computing Compression Trees for Data Collection in Wireless Sensor Networks
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
Jian Li, Amol Deshpande, Samir Khuller
IPPS
2000
IEEE
15 years 10 months ago
Optimal on Demand Packet Scheduling in Single-Hop Multichannel Communication Systems
In this paper, we study the problem of on demand minimum length packet scheduling in single-hop multichannel systems. Examples of these systems are those centered around switching...
Maurizio A. Bonuccelli, Susanna Pelagatti
IWCMC
2006
ACM
16 years 5 hour ago
On the robustness of grid-based deployment in wireless sensor networks
Grid-based sensor deployment is an effective and efficient practice for provisioning wireless sensor networks. Previous work has addressed grid-based deployment of sensors in orde...
Kenan Xu, Glen Takahara, Hossam S. Hassanein
ICMCS
2000
IEEE
134views Multimedia» more  ICMCS 2000»
15 years 10 months ago
TBLB Algorithm for Servicing Real-Time Multimedia Traffic Streams
In this paper, we propose to use a simple packet servicing algorithm suitable for servicing bursty real-time multimedia traffic streams in packet-switched networks. These real-tim...
William K. Wong, Victor C. M. Leung
JOC
2006
71views more  JOC 2006»
15 years 6 months ago
Private Computation: k-Connected versus 1-Connected Networks
We study the role of connectivity of communication networks in private computations under information theoretic settings. It will be shown that some functions can be computed by pr...
Markus Bläser, Andreas Jakoby, Maciej Liskiew...