170 search results - page 28 / 34 » A Simple Greedy Algorithm for the k-Disjoint Flow Problem |
ESA
2004
Springer
14 years 28 days ago
2004
Springer
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
TC
1998
13 years 7 months ago
1998
ion Techniques for Validation Coverage Analysis and Test Generation Dinos Moundanos, Jacob A. Abraham, Fellow, IEEE, and Yatin V. Hoskote —The enormous state spaces which must be...
DCC
2003
IEEE
14 years 7 months ago
2003
IEEE
Practical applications that employ entropy coding for large alphabets often partition the alphabet set into two or more layers and encode each symbol by using some suitable prefix...
INFOCOM
2003
IEEE
14 years 24 days ago
2003
IEEE
— A method commonly used for packet flow control over connections with long round-trip delays is “sliding windows”. In general, for a given loss rate, a larger window size a...
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
We study the problem of optimal resource allocation for multi-user wireless video transmissions from an informationtheoretic point of view. We show that the previously known optima...