151 search results - page 1 / 31 » A Max-Flow Min-Cut Algorithm for a Class of Wireless Network... |
SODA
2010
ACM
14 years 2 months ago
2010
ACM
The linear deterministic model of relay channels is a generalization of the traditional directed network model which has become popular in the study of the flow of information ove...
SIAMCOMP
1998
13 years 4 months ago
1998
It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow instances with arbitrary capacities and demands. This im...
CVPR
2010
IEEE
13 years 7 months ago
2010
IEEE
Abstract. This work addresses a class of total-variation based multilabeling problems over a spatially continuous image domain, where the data fidelity term can be any bounded fun...
INFOCOM
2009
IEEE
13 years 11 months ago
2009
IEEE
—In layered networks, a single failure at a lower layer may cause multiple failures in the upper layers. As a result, traditional schemes that protect against single failures may...
9
Voted
SIGCOMM
2010
ACM
13 years 5 months ago
2010
ACM
This paper proposes a fair association scheme between clients and APs in WiFi network, exploiting the hybrid nature of the recent WLAN architecture. We show that such an associati...