242 search results - page 22 / 49 » Approximately uniform random sampling in sensor networks |
CIKM
2009
Springer
14 years 3 months ago
2009
Springer
We consider the problem of releasing a limited public view of a sensitive graph which reveals at least k edges per node. We are motivated by Facebook’s public search listings, w...
LCN
2005
IEEE
14 years 2 months ago
2005
IEEE
— The sensing capabilities of networked sensors are affected by environmental factors in real deployment and it is imperative to have practical considerations at the design stage...
SIGMOD
2005
ACM
14 years 8 months ago
2005
ACM
Complex queries over high speed data streams often need to rely on approximations to keep up with their input. The research community has developed a rich literature on approximat...
OPODIS
2004
13 years 9 months ago
2004
A network is k-connected if it remains connected after the removal of any k - 1 of its nodes. Assume that n sensors, modeled here as (omni)directional antennas, are dropped random...
ICASSP
2011
IEEE
13 years 5 days ago
2011
IEEE
In this paper a exible, high-throughput, low-complexity additive white gaussian noise (AWGN) channel generator is presented. The proposed generator employs a Mersenne-Twister to g...