We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
Flavio Bonomi, Michael Mitzenmacher, Rina Panigrah...
ABSTRACT: Linear function approximations based on random projections are proposed and justified for a class of fixed point and minimization problems. KEY WORDS: random projections,...
—Bit-interleaved coded modulation (BICM) has been adopted in many systems and standards for spectrally efficient coded transmission. The analytical evaluation of BICM performanc...
The basic nonlinear filtering problem for dynamical systems is considered. Approximating the optimal filter estimate by particle filter methods has become perhaps the most common a...