536 search results - page 94 / 108 » The hardness and approximation algorithms for l-diversity |
MOBIHOC
2007
ACM
14 years 6 months ago
2007
ACM
The non-existence of an end-to-end path poses a challenge in adapting the traditional routing algorithms to delay tolerant networks (DTNs). Previous works include centralized rout...
MOBIHOC
2003
ACM
14 years 6 months ago
2003
ACM
Spatial query execution is an essential functionality of a sensor network, where a query gathers sensor data within a specific geographic region. Redundancy within a sensor networ...
MOBIHOC
2003
ACM
14 years 6 months ago
2003
ACM
In this paper, we address the problem of energy-conscious cache placement in wireless ad hoc networks. We consider a network comprising a server with an interface to the wired net...
IPSN
2010
Springer
14 years 1 months ago
2010
Springer
A key problem in sensor networks is to decide which sensors to query when, in order to obtain the most useful information (e.g., for performing accurate prediction), subject to co...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...