Results 1  10
of
1,408
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 190 (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
From Static Code Distribution to More Shrinkage for the Multiterminal Cut
"... Abstract. 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 ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. 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
Network information flow
 IEEE TRANS. INFORM. THEORY
, 2000
"... We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a pointtopoint communication network on which a number of information sources are to be mulitcast to certain sets of destinations. We assume that the information source ..."
Abstract

Cited by 1961 (24 self)
 Add to MetaCart
coding rate region. Our result can be regarded as the Maxflow Mincut Theorem for network information flow. Contrary to one’s intuition, our work reveals that it is in general not optimal to regard the information to be multicast as a “fluid” which can simply be routed or replicated. Rather
An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1993
"... AbstractA 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 vert ..."
Abstract

Cited by 351 (0 self)
 Add to MetaCart
vertices. Clustering is achieved by removing arcs of G to form mutually exclusive subgraphs such that the largest intersubgraph maximum flow is minimized. For graphs of moderate size ( 2000 vertices), the optimal solution is obtained through partitioning a flow and cut equivalent tree of 6, which can
Cascade multiterminal source coding
 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY. AUTHORIZED LICENSED USE LIMITED TO: STANFORD UNIVERSITY. DOWNLOADED ON MARCH 02,2010 AT 16:56:04 EST FROM IEEE XPLORE. RESTRICTIONS APPLY
, 2009
"... We investigate distributed source coding of two correlated sources X and Y where messages are passed to a decoder in a cascade fashion. The encoder of X sends a message at rate R 1 to the encoder of Y. The encoder of Y then sends a message to the decoder at rate R 2 based both on Y and on the messa ..."
Abstract

Cited by 22 (6 self)
 Add to MetaCart
of X and Y losslessly. Our general contribution toward understanding the limits of the cascade multiterminal source coding network is in the form of inner and outer bounds on the achievable rate region for satisfying a distortion constraint for an arbitrary distortion function d(x, y, z). The inner
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
When trees collide: An approximation algorithm for the generalized Steiner problem on networks
, 1994
"... We give the first approximation algorithm for the generalized network Steiner problem, a problem in network design. An instance consists of a network with linkcosts and, for each pair fi; jg of nodes, an edgeconnectivity requirement r ij . The goal is to find a minimumcost network using the a ..."
Abstract

Cited by 256 (39 self)
 Add to MetaCart
cost networks to maximum packings of certain kinds of cuts. As a consequence of the proof of this theorem, we obtain an approximation algorithm for optimally packing these cuts; we show that this algorithm has application to estimating the reliability of a probabilistic network.
Results 1  10
of
1,408