Sciweavers

727 search results - page 65 / 146
» A Calculus of Bounded Capacities
Sort
View
VTC
2007
IEEE
148views Communications» more  VTC 2007»
14 years 1 months ago
Iteratively Detected Irregular Variable Length Coding and Sphere-Packing Modulation-Aided Differential Space-Time Spreading
Abstract— In this paper we consider serially concatenated and iteratively decoded Irregular Variable Length Coding (IrVLC) combined with precoded Differential Space-Time Spreadin...
Mohammed El-Hajjar, Robert G. Maunder, Osamah Alam...
ESA
2005
Springer
114views Algorithms» more  ESA 2005»
14 years 1 months ago
Unbalanced Graph Cuts
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
Ara Hayrapetyan, David Kempe, Martin Pál, Z...
FOCS
1997
IEEE
13 years 12 months ago
Beyond the Flow Decomposition Barrier
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
Andrew V. Goldberg, Satish Rao
CORR
2008
Springer
88views Education» more  CORR 2008»
13 years 7 months ago
Coding Strategies for Noise-free Relay Cascades with Half-Duplex Constraint
Abstract--Two types of noise-free relay cascades are investigated. Networks where a source communicates with a distant receiver via a cascade of half-duplex constrained relays, and...
Tobias Lutz, Christoph Hausl, Ralf Koetter
ALGORITHMICA
2006
160views more  ALGORITHMICA 2006»
13 years 7 months ago
Combinatorial Algorithms for the Unsplittable Flow Problem
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
Yossi Azar, Oded Regev