Sciweavers

198 search results - page 40 / 40
» On the Lower Bound of Local Optimums in K-Means Algorithm
Sort
View
MOBICOM
2006
ACM
13 years 11 months ago
On optimal communication cost for gathering correlated data through wireless sensor networks
In many energy-constrained wireless sensor networks, nodes cooperatively forward correlated sensed data to data sinks. In order to reduce the communication cost (e.g. overall ener...
Junning Liu, Micah Adler, Donald F. Towsley, Chun ...
ICALP
2003
Springer
13 years 10 months ago
Anycasting in Adversarial Systems: Routing and Admission Control
Abstract. In this paper we consider the problem of routing packets in dynamically changing networks, using the anycast mode. In anycasting, a packet may have a set of destinations ...
Baruch Awerbuch, André Brinkmann, Christian...
DCOSS
2006
Springer
13 years 9 months ago
GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
Lujun Jia, Guevara Noubir, Rajmohan Rajaraman, Rav...