54 search results - page 3 / 11 » Lower Bounds for the Noisy Broadcast Problem |
ICPADS
1998
IEEE
13 years 9 months ago
1998
IEEE
The dynamic broadcast problem is the communication problem where source packets to be broadcast to all the other nodes are generated at each node of a parallel computer accordingt...
WDAG
1999
Springer
13 years 9 months ago
1999
Springer
This short paper establishes lower bounds on the time complexity of algorithms solving the generic broadcast problem. The paper shows that (a) to deliver messages in one round, no...
INFOCOM
2007
IEEE
13 years 11 months ago
2007
IEEE
— A wide range of applications for wireless ad hoc networks are time-critical and impose stringent requirement on the communication latency. This paper studies the problem Minimu...
ALGORITHMICA
2010
13 years 5 months ago
2010
We consider a novel class of art gallery problems inspired by wireless localization. Given a simple polygon P, place and orient guards each of which broadcasts a unique key within ...
TSP
2008
13 years 5 months ago
2008
Abstract-- We consider approximations of signals by the elements of a frame in a complex vector space of dimension N and formulate both the noiseless and the noisy sparse represent...