54 search results - page 5 / 11 » Lower Bounds for the Noisy Broadcast Problem |
MOBIHOC
2006
ACM
14 years 7 months ago
2006
ACM
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...
JMIV
2006
13 years 7 months ago
2006
We address the problem of reconstructing a planar shape from a finite number of noisy measurements of its support function or its diameter function. New linear and non-linear algor...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
In this paper we investigate the fault diagnosis problem in IP networks. We provide a lower bound on the average number of probes per edge using variational inference technique pro...
WDAG
2010
Springer
13 years 5 months ago
2010
Springer
We show that the asymptotic gain in the time complexity when using collision detection depends heavily on the task by investigating three prominent problems for wireless networks,...
TSP
2010
13 years 2 months ago
2010
Abstract--This paper investigates the impulse response estimation of linear time-invariant (LTI) systems when only noisy finitelength input-output data of the system is available. ...