We present a graph theoretic upper bound on speedup needed to achieve 100% throughput in a multicast switch using network coding. By bounding speedup, we show the equivalence betwe...
MinJi Kim, Jay Kumar Sundararajan, Muriel Mé...
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
Abstract-- A generic intuition says that the pre-log, or multiplexing gain, cannot be larger than the minimum of the number of transmit and receive dimensions. This suggests that f...
We investigate the behavior of a large number of selfish users that are able to switch dynamically between multiple wireless access-points (possibly belonging to different standard...
A novel technique for the fabrication of micro electromagnetic actuators was proposed and a prototype was designed and fabricated in this study. The constituent parts of the design...
ABSTRACT. In this paper modified variants of the sparse Fourier transform algorithms from [14] are presented which improve on the approximation error bounds of the original algorit...
Abstract--A multiple access channel and a point-to-point channel sharing the same medium for communications are considered. We obtain an outer bound for the capacity region of this...