We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...
We consider the design of asymmetric multiple description lattice quantizers that cover the entire spectrum of the distortion profile, ranging from symmetric or balanced to success...
Suhas N. Diggavi, N. J. A. Sloane, Vinay A. Vaisha...
We consider the problem of sorting a permutation using a network of data structures as introduced by Knuth and Tarjan. In general the model as considered previously was restricted...
In this work, the problem of the estimation of parameters in case of mixtures of models composed by the sum of multiple Gaussians is considered. It will be shown how this estimati...
This is a brief journey across the Internet privacy landscape. After trying to convince you about the importance of the problem I will try to present questions of interest and how...