2149 search results - page 97 / 430 » Distributed Algorithms for Approximating Wireless Network Ca... |
STOC
2005
ACM
16 years 1 months ago
2005
ACM
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
IH
2009
Springer
15 years 8 months ago
2009
Springer
This paper is concerned with the estimation of steganographic capacity in digital images, using information theoretic bounds and very large-scale experiments to approximate the dis...
111
click to vote
ICCCN
2007
IEEE
15 years 7 months ago
2007
IEEE
Abstract— One of the major advantages of wireless communication over wired is the flexibility when creating links between nodes. But this comes at a price as influences from ou...
110
click to vote
TMC
2008
15 years 1 months ago
2008
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
109
click to vote
ISPDC
2010
IEEE
14 years 11 months ago
2010
IEEE
We propose a two layer protocol for tracking fast targets in sensor networks. At the lower layer, the Distributed Spanning Tree Algorithm (DSTA) [12] partitions the network into c...