Results 1  10
of
5,532
Theoretical improvements in algorithmic efficiency for network flow problems

, 1972
"... This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps req ..."
Abstract

Cited by 560 (0 self)
 Add to MetaCart
This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps
Capacity Upper Bounds for the Deletion Channel
"... Abstract — We present two upper bounds on the capacity of the i.i.d. binary deletion channel, where each bit is independently deleted with a fixed probability d. The first can be numerically evaluated for any fixed d. The second provides an asymptotic upper bound as d goes to 1. These appear to be t ..."
Abstract

Cited by 17 (3 self)
 Add to MetaCart
to be the first nontrivial upper bounds for this probabilistic deletion channel. I.
Multicommodity maxflow mincut theorems and their use in designing approximation algorithms
 J. ACM
, 1999
"... In this paper, we establish maxflow mincut theorems for several important classes of multicommodity flow problems. In particular, we show that for any nnode multicommodity flow problem with uniform demands, the maxflow for the problem is within an O(log n) factor of the upper bound implied by ..."
Abstract

Cited by 357 (6 self)
 Add to MetaCart
In this paper, we establish maxflow mincut theorems for several important classes of multicommodity flow problems. In particular, we show that for any nnode multicommodity flow problem with uniform demands, the maxflow for the problem is within an O(log n) factor of the upper bound implied
Two new bounds for the randomedge simplex algorithm
, 2008
"... We prove that the RandomEdge simplex algorithm requires an expected number of at most 13n / √ d pivot steps on any simple dpolytope with n vertices. This is the first nontrivial upper bound for general polytopes. We also describe a refined analysis that potentially yields much better bounds for s ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We prove that the RandomEdge simplex algorithm requires an expected number of at most 13n / √ d pivot steps on any simple dpolytope with n vertices. This is the first nontrivial upper bound for general polytopes. We also describe a refined analysis that potentially yields much better bounds
Upper Bounds on the Lifetime of Sensor Networks
, 2001
"... In this paper, we ask a fundamental question concerning the limits of energy e#ciency of sensor networks  What is the upper bound on the lifetime of a sensor network that collects data from a specified region using a certain number of energyconstrained nodes? The answer to this question is valuabl ..."
Abstract

Cited by 198 (4 self)
 Add to MetaCart
In this paper, we ask a fundamental question concerning the limits of energy e#ciency of sensor networks  What is the upper bound on the lifetime of a sensor network that collects data from a specified region using a certain number of energyconstrained nodes? The answer to this question
Unveiling Turbo Codes: Some Results on Parallel Concatenated Coding Schemes
, 1995
"... A parallel concatenated coding scheme consists of two simple constituent systematic encoders linked by an interleaver. The input bits to the first encoder are scrambled by the interleaver before entering the second encoder. The codeword of the parallel concatenated code consists of the input bits to ..."
Abstract

Cited by 314 (6 self)
 Add to MetaCart
to that of the constituent codes, have been recently shown to yield remarkable coding gains close to theoretical limits. They have been named, and are known as, "turbo codes". We propose a method to evaluate an upper bound to the bit error probability of a parallel concatenated coding scheme averaged over all
On the achievable diversitymultiplexing tradeoff in halfduplex cooperative channels
 IEEE TRANS. INFORM. THEORY
, 2005
"... We propose novel cooperative transmission protocols for delaylimited coherent fading channels consisting of (halfduplex and singleantenna) partners and one cell site. In our work, we differentiate between the relay, cooperative broadcast (downlink), and cooperative multipleaccess (CMA) (uplin ..."
Abstract

Cited by 311 (11 self)
 Add to MetaCart
link) channels. The proposed protocols are evaluated using Zheng–Tse diversity–multiplexing tradeoff. For the relay channel, we investigate two classes of cooperation schemes; namely, amplify and forward (AF) protocols and decode and forward (DF) protocols. For the first class, we establish an upper bound
LeaveOneOut Support Vector Machines
, 1999
"... We present a new learning algorithm for pattern recognition inspired by a recent upper bound on leaveoneout error [ Jaakkola and Haussler, 1999 ] proved for Support Vector Machines (SVMs) [ Vapnik, 1995; 1998 ] . The new approach directly minimizes the expression given by the bound in an attempt ..."
Abstract

Cited by 301 (5 self)
 Add to MetaCart
We present a new learning algorithm for pattern recognition inspired by a recent upper bound on leaveoneout error [ Jaakkola and Haussler, 1999 ] proved for Support Vector Machines (SVMs) [ Vapnik, 1995; 1998 ] . The new approach directly minimizes the expression given by the bound
New Bounds on the Capacity of Multidimensional RunLength Constraints
, 2011
"... We examine the wellknown problem of determining the capacity of multidimensional runlengthlimited constrained systems. By recasting the problem, which is essentially a combinatorial counting problem, into a probabilistic setting, we are able to derive new lower and upper bounds on the capacity o ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
of RLL systems. These bounds are better than all previouslyknown analytical bounds for , and are tight asymptotically. Thus, we settle the open question: what is the rate at which the capacity of RLL systems converges to 1 as ? We also provide the first nontrivial upper bound on the capacity
Planar Drawings and Angular Resolution: Algorithms and Bounds (Extended Abstract)
 IN PROC. 2ND ANNU. EUROPEAN SYMPOS. ALGORITHMS
, 1994
"... We investigate the problem of constructing planar straightline drawings of graphs with large angles between the edges. Namely, we study the angular resolution of planar straightline drawings, defined as the smallest angle formed by two incident edges. We prove the first nontrivial upper bound on th ..."
Abstract

Cited by 31 (5 self)
 Add to MetaCart
We investigate the problem of constructing planar straightline drawings of graphs with large angles between the edges. Namely, we study the angular resolution of planar straightline drawings, defined as the smallest angle formed by two incident edges. We prove the first nontrivial upper bound
Results 1  10
of
5,532