641 search results - page 8 / 129 » Improved Bounds for Wireless Localization |
COMPGEOM
2010
ACM
14 years 22 days ago
2010
ACM
We prove that the union complexity of a set of n constantcomplexity locally fat objects (which can be curved and/or non-convex) in the plane is O(λt+2(n) log n), where t is the m...
ECCC
2011
13 years 2 months ago
2011
We consider the problem of extracting randomness from sources that are efficiently samplable, in the sense that each output bit of the sampler only depends on some small number d ...
MSWIM
2004
ACM
14 years 1 months ago
2004
ACM
Discrete event network simulators have emerged as popular tools for verification and performance evaluation for various wireless networks. Nevertheless, the desire to model such ...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
MFCS
2009
Springer
14 years 6 days ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...