Sciweavers

2149 search results - page 342 / 430
» Distributed Algorithms for Approximating Wireless Network Ca...
Sort
View
SODA
2010
ACM
197views Algorithms» more  SODA 2010»
15 years 10 months ago
Quasirandom Load Balancing
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
Tobias Friedrich, Martin Gairing, Thomas Sauerwald
PODS
2009
ACM
119views Database» more  PODS 2009»
16 years 1 months ago
Exceeding expectations and clustering uncertain data
Database technology is playing an increasingly important role in understanding and solving large-scale and complex scientific and societal problems and phenomena, for instance, un...
Sudipto Guha, Kamesh Munagala
IJAHUC
2006
128views more  IJAHUC 2006»
15 years 1 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
NETWORKING
2007
15 years 2 months ago
Location-Unaware Sensing Range Assignment in Sensor Networks
We study field-monitoring applications in which sensors are deployed in large numbers and the sensing process is expensive. In such applications, nodes should use the minimum poss...
Ossama Younis, Srinivasan Ramasubramanian, Marwan ...
FCCM
2006
IEEE
113views VLSI» more  FCCM 2006»
15 years 7 months ago
GraphStep: A System Architecture for Sparse-Graph Algorithms
— Many important applications are organized around long-lived, irregular sparse graphs (e.g., data and knowledge bases, CAD optimization, numerical problems, simulations). The gr...
Michael DeLorimier, Nachiket Kapre, Nikil Mehta, D...