We consider the problem of network coding across multiple unicasts. We give, for wired and wireless networks, efficient polynomial time algorithms for finding optimal network code...
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...
Abraham Flaxman, David Gamarnik, Gregory B. Sorkin
— In cognitive radio networks (CRNs), effective and efficient channel exploitation is imperative for unlicensed secondary users to seize available network resources and improve ...
We consider the problem of binary hypothesis testing using binary decisions from independent and identically distributed (i.i.d). sensors. Identical likelihood-ratio quantizers wit...
We consider a multiuser two-way relay network where multiple pairs of users exchange information with the assistance of a relay node, using orthogonal channels per pair. For a vari...