We study auctions with severe bounds on the communication allowed: each bidder may only transmit t bits of information to the auctioneer. We consider both welfare- and profit-max...
We design communication efficient two-party and multi-party protocols for the longest common subsequence (LCS) and related problems. Our protocols achieve privacy with respect to p...
Matthew K. Franklin, Mark Gondree, Payman Mohassel
Abstract—In this paper we propose non-regenerative multicarrier multiple-input multiple-output (MIMO) relay techniques that minimize the mean-squared error (MSE) of the signal wa...
Based on the good time-frequency localization of the pulse shaping, it is possible to build a multicarrier modulation that reduces both narrowband interferences and multipath chan...
In complex distributed applications, a problem is often decomposed into a set of subproblems that are distributed to multiple agents. We formulate this class of problems with a tw...