We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
This survey reviews fundamental concepts of multi-user information theory. Starting with typical sequences, the survey builds up knowledge on random coding, binning, superposition...
We consider the Bayesian ranking and selection problem, in which one wishes to allocate an information collection budget as efficiently as possible to choose the best among severa...
This work contributes to the robotic bin-picking problem, and more specifically to the problem of localizing piled box-like objects. We employ range imagery, and use box-like Supe...
We study the joint source channel coding problem of transmitting an analog source over a Gaussian channel in two cases - (i) the presence of interference known only to the transmit...
Makesh Pravin Wilson, Krishna R. Narayanan, Giusep...