Results 1  10
of
555,034
The Complexity of Multiterminal Cuts
 SIAM Journal on Computing
, 1994
"... In the Multiterminal Cut problem we are given an edgeweighted graph and a subset of the vertices called terminals, and asked for a minimum weight set of edges that separates each terminal from all the others. When the number k of terminals is two, this is simply the mincut, maxflow problem, and ..."
Abstract

Cited by 194 (0 self)
 Add to MetaCart
In the Multiterminal Cut problem we are given an edgeweighted graph and a subset of the vertices called terminals, and asked for a minimum weight set of edges that separates each terminal from all the others. When the number k of terminals is two, this is simply the mincut, maxflow problem
AN INTELLIGENT MULTITERMINAL INTERFACE by
, 1987
"... This material represents the author's original work except where specific acknowledgement is made, and has not been submitted in part, or in whole, to any other University for degree purposes. 11 Acknowledgements My thanks go to my supervisor Professor Lee Nattrass, not only for his guidance du ..."
Abstract
 Add to MetaCart
This material represents the author's original work except where specific acknowledgement is made, and has not been submitted in part, or in whole, to any other University for degree purposes. 11 Acknowledgements My thanks go to my supervisor Professor Lee Nattrass, not only for his guidance during the course of the project, but also for allowing me the time to do the work when the departmental lecturing load has been so high. I also thank him for his patience while waiting for me to complete the thesis which has been awaiting final proof reading for far too long. Thanks also go to my colleagues Dave Levy and Nils Otte who suffered my ministrations to their computer systems while 1 was debugging the RMUX interface software. Thanks also for their show of faith in using so many of the final units. Special thanks must also go to my wife Eleanor for her encouragement,
Equivalent Models for Multiterminal Channels
 IEEE INFORMATION THEORY WORKSHOP
, 2011
"... The recently introduced network equivalence results are used to create bitpipe models that can replace multiterminal channels within a discrete memoryless network. The goal is to create a set of simple “components” or “blocks” that can be substituted for the channel in such a way that the resultin ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
The recently introduced network equivalence results are used to create bitpipe models that can replace multiterminal channels within a discrete memoryless network. The goal is to create a set of simple “components” or “blocks” that can be substituted for the channel in such a way
Control of Multiterminal VSCHVDC for Offshore Wind Power Integration
, 2010
"... Wind power evolution in Northern Europe is foreseen to continue in the future with development of largescale wind power plants (WPPs) on far offshore. Integration scheme of these WPPs to the onshore grids would grow from pointtopoint connection to a transnational multiterminal network where the ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Wind power evolution in Northern Europe is foreseen to continue in the future with development of largescale wind power plants (WPPs) on far offshore. Integration scheme of these WPPs to the onshore grids would grow from pointtopoint connection to a transnational multiterminal network where
Multiterminal Secrecy in a Linear Noncoherent Packetized Networks
, 2012
"... We consider a group of m + 1 trusted nodes that aim to create a shared secret key K over a network in the presence of a passive eavesdropper, Eve. We assume a linear noncoherent network coding broadcast channel (over a finite field Fq) from one of the honest nodes (i.e., Alice) to the rest of them ..."
Abstract
 Add to MetaCart
We consider a group of m + 1 trusted nodes that aim to create a shared secret key K over a network in the presence of a passive eavesdropper, Eve. We assume a linear noncoherent network coding broadcast channel (over a finite field Fq) from one of the honest nodes (i.e., Alice) to the rest of them
Converses For Discrete Memoryless Multiterminal Networks
, 2010
"... In this paper we show that the “potential function method” can provide a unified framework for proving converses for problems of determining the rate region of multiterminal communication networks. In this method, for a given network structure, we simultaneously consider all possible networks compat ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
of functions of dependent sources over a discrete memoryless multiterminal network; (2) we generalize the outer bound part of the recent result of Maric, Yates and Kramer on strong interference channels with a common message to include dependent sources; and (3) we simplify the recent outer bound of Liang
Optimal Placement for MultiTerminal Nets
"... In the general multiterminal placement problem we have to place tbe terminals of n multiterminal nets in aoy of a number of given positions in a channel. The positions for tbe terminals must be chosen so that tbe connections made by a routing algorithm (which follows the placement) require a chan ..."
Abstract
 Add to MetaCart
In the general multiterminal placement problem we have to place tbe terminals of n multiterminal nets in aoy of a number of given positions in a channel. The positions for tbe terminals must be chosen so that tbe connections made by a routing algorithm (which follows the placement) require a
From static code distribution to more shrinkage for the multiterminal cut
, 2005
"... We present the problem of statically distributing instructions of a common programming language, a problem which we prove equivalent to the multiterminal cut problem. We design efficient shrinkage techniques which allow to reduce the size of an instance in such a way that optimal solutions are pr ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We present the problem of statically distributing instructions of a common programming language, a problem which we prove equivalent to the multiterminal cut problem. We design efficient shrinkage techniques which allow to reduce the size of an instance in such a way that optimal solutions
Results 1  10
of
555,034