806 search results - page 23 / 162 » Lower Bounds on Correction Networks |
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
The area of derandomization attempts to provide efficient deterministic simulations of randomized algorithms in various algorithmic settings. Goldreich and Wigderson introduced a n...
WDAG
2000
Springer
15 years 1 months ago
2000
Springer
This paper presents a scalable leader election protocol for large process groups with a weak membership requirement. The underlying network is assumed to be unreliable but characte...
IPSN
2005
Springer
15 years 3 months ago
2005
Springer
We bound the number of sensors required to achieve a desired level of sensing accuracy in a discrete sensor network application (e.g. distributed detection). We model the state of...
GLOBECOM
2010
IEEE
14 years 6 months ago
2010
IEEE
In this paper we investigate the static multicast advance reservation (MCAR) problem for all-optical wavelengthrouted WDM networks. Advance reservation connection requests specify ...
FGCN
2007
IEEE
15 years 3 months ago
2007
IEEE
In many applications of sensor networks, it is essential to ensure that messages are transmitted to their destinations as early as possible and the buffer size of each sensor node...