Sciweavers

2956 search results - page 437 / 592
» Efficient Communication by Breathing
Sort
View
MOBIHOC
2009
ACM
16 years 7 months ago
Secure multidimensional range queries in sensor networks
Most future large-scale sensor networks are expected to follow a two-tier architecture which consists of resource-rich master nodes at the upper tier and resource-poor sensor node...
Rui Zhang, Jing Shi, Yanchao Zhang
STOC
2003
ACM
90views Algorithms» more  STOC 2003»
16 years 6 months ago
Work-competitive scheduling for cooperative computing with dynamic groups
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
Chryssis Georgiou, Alexander Russell, Alexander A....
ICALP
2009
Springer
16 years 6 months ago
Improved Algorithms for Latency Minimization in Wireless Networks
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
Alexander Fanghänel, Berthold Vöcking, T...
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
16 years 6 months ago
Ranking distributed probabilistic data
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
Feifei Li, Ke Yi, Jeffrey Jestes
PODS
2008
ACM
128views Database» more  PODS 2008»
16 years 6 months ago
Shape sensitive geometric monitoring
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in ...
Izchak Sharfman, Assaf Schuster, Daniel Keren