806 search results - page 10 / 162 » Lower Bounds on Correction Networks |
ESA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
EUROCRYPT
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. A secure failure-localization path-quality-monitoring (FLPQM) protocols allows a sender to localize faulty links on a single path through a network to a receiver, even wh...
SIAMCOMP
2000
13 years 7 months ago
2000
This paper presents a lower bound of (D + n/ log n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of ...
FMICS
2010
Springer
13 years 7 months ago
2010
Springer
We investigate the application of the software bounded model checking tool CBMC to the domain of wireless sensor networks (WSNs). We automatically generate a software behavior mode...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In the online packet buffering problem (also known as the unweighted FIFO variant of buffer management), we focus on a single network packet switching device with several input po...