Results 1  10
of
3,200
The Hardness of Minimum Capacity Network Design
"... We define the Minimum Capacity Network Design problem (MCND) and present a taxonomy of its variants. We consider all variants s.t. their input does not admit a general compressed form, and prove that each such variant, provided that it is not "trivial", is NPcomplete. 1 Introduction This ..."
Abstract
 Add to MetaCart
We define the Minimum Capacity Network Design problem (MCND) and present a taxonomy of its variants. We consider all variants s.t. their input does not admit a general compressed form, and prove that each such variant, provided that it is not "trivial", is NPcomplete. 1 Introduction
Implementing an Efficient Minimum Capacity Cut Algorithm
 MATHEMATICAL PROGRAMMING
, 1994
"... In this paper, we present an efficient implementation of the O(mn + n 2 log n) time algorithm originally proposed by Nagamochi and Ibaraki (1992) for computing the minimum capacity cut of an undirected network. To enhance computation, various ideas are added so that it can contract as many edges ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
In this paper, we present an efficient implementation of the O(mn + n 2 log n) time algorithm originally proposed by Nagamochi and Ibaraki (1992) for computing the minimum capacity cut of an undirected network. To enhance computation, various ideas are added so that it can contract as many edges
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
in the flow value then, provided the capacities are integral, a maximum flow will be determined within at most 1 + logM/(M1) if(t, S) augmentations, wheref*(t, s) is the value of the maximum flow and M is the maximum number of arcs across a cut. Next a new algorithm is given for the minimumcost flow
Spacetime codes for high data rate wireless communication: Performance criterion and code construction
 IEEE TRANS. INFORM. THEORY
, 1998
"... We consider the design of channel codes for improving the data rate and/or the reliability of communications over fading channels using multiple transmit antennas. Data is encoded by a channel code and the encoded data is split into n streams that are simultaneously transmitted using n transmit ant ..."
Abstract

Cited by 1782 (28 self)
 Add to MetaCart
constructed from pairs of distinct code sequences. The minimum rank among these matrices quantifies the diversity gain, while the minimum determinant of these matrices quantifies the coding gain. The results are then extended to fast fading channels. The design criteria are used to design trellis codes
An Efficient Algorithm for Computing Robust Minimum Capacity st Cuts
, 2008
"... The Minimum Capacity st Cut Problem (Min Cut) is an intensively studied problem in combinatorial optimization. In this paper, we study Min Cut when arc capacities are uncertain but known to exist in prespecified intervals. This framework can be used to model many realworld applications of Min Cut ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The Minimum Capacity st Cut Problem (Min Cut) is an intensively studied problem in combinatorial optimization. In this paper, we study Min Cut when arc capacities are uncertain but known to exist in prespecified intervals. This framework can be used to model many realworld applications of Min
Minimum Capacity of Measure Maximum Size of Coarse Aggregate Specified
, 2010
"... This test method describes the procedure for determining the unit weight of freshly mixed concrete. Formulas incorporating the measured unit weight and observed scale weights of all ingredients are included for the calculation of batch volume and actual cement content. ..."
Abstract
 Add to MetaCart
This test method describes the procedure for determining the unit weight of freshly mixed concrete. Formulas incorporating the measured unit weight and observed scale weights of all ingredients are included for the calculation of batch volume and actual cement content.
Spectral Efficiency in the Wideband Regime
, 2002
"... The tradeoff of spectral efficiency (b/s/Hz) versus energy perinformation bit is the key measure of channel capacity in the wideband powerlimited regime. This paper finds the fundamental bandwidthpower tradeoff of a general class of channels in the wideband regime characterized by low, but nonz ..."
Abstract

Cited by 393 (29 self)
 Add to MetaCart
The tradeoff of spectral efficiency (b/s/Hz) versus energy perinformation bit is the key measure of channel capacity in the wideband powerlimited regime. This paper finds the fundamental bandwidthpower tradeoff of a general class of channels in the wideband regime characterized by low
A VectorPerturbation technique for NearCapacity . . .
 IEEE TRANS. COMMUN
, 2005
"... Recent theoretical results describing the sum capacity when using multiple antennas to communicate with multiple users in a known rich scattering environment have not yet been followed with practical transmission schemes that achieve this capacity. We introduce a simple encoding algorithm that achi ..."
Abstract

Cited by 323 (10 self)
 Add to MetaCart
that while the sum capacity grows linearly with the minimum of the number of antennas and users, the sum rate of channel inversion does not. This poor performance is due to the large spread in the singular values of the channel matrix. We introduce regularization to improve the condition of the inverse
Zeroforcing methods for downlink spatial multiplexing in multiuser MIMO channels
 IEEE TRANS. SIGNAL PROCESSING
, 2004
"... The use of spacedivision multiple access (SDMA) in the downlink of a multiuser multipleinput, multipleoutput (MIMO) wireless communications network can provide a substantial gain in system throughput. The challenge in such multiuser systems is designing transmit vectors while considering the coc ..."
Abstract

Cited by 371 (29 self)
 Add to MetaCart
channel interference of other users. Typical optimization problems of interest include the capacity problem—maximizing the sum information rate subject to a power constraint—or the power control problem—minimizing transmitted power such that a certain qualityofservice metric for each user is met. Neither
An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1993
"... A novel graph theoretic approach for data clustering is presented and its application to the image segmentation problem is demonstrated. The data to be clustered are represented by an undirected adjacency graph G with arc capacities assigned to reflect the similarity between the linked vertices. Cl ..."
Abstract

Cited by 360 (0 self)
 Add to MetaCart
A novel graph theoretic approach for data clustering is presented and its application to the image segmentation problem is demonstrated. The data to be clustered are represented by an undirected adjacency graph G with arc capacities assigned to reflect the similarity between the linked vertices
Results 1  10
of
3,200