— Given a fixed network where each node has some given initial value, and under the constraint that each node receives noisy transmissions from its immediate neighbors, we provi...
k-mutual exclusion is an important problem for resourceintensive peer-to-peer applications ranging from aggregation to file downloads. In order to be practically useful, k-mutual...
— In the reversible conversion of color images to gray ones, colors are mapped to textures and from the textures the receiver can recover the colors, i.e. one may print a color i...
Abstract We consider the linear coding of a discrete memoryless Gaussian source transmitted through a discrete memoryless fading channel with additive white Gaussian noise (AWGN)...
The increasing popularity of high-volume performancecritical Internet applications calls for a scalable server design that allows meeting individual response-time guarantees. Cons...