524 search results - page 32 / 105 » An Optimal Lower Bound on the Communication Complexity of Ga... |
FOCS
2002
IEEE
14 years 20 days ago
2002
IEEE
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...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
GLOBECOM
2008
IEEE
13 years 7 months ago
2008
IEEE
The complexity of sphere decoding (SD) has been widely studied due to the importance of this algorithm in obtaining the optimal Maximum Likelihood (ML) performance with lower compl...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
The classical problem of reliable point-to-point digital communication is to achieve a low probability of error while keeping the rate high and the total power consumption small. ...
JACM
2008
13 years 7 months ago
2008
We consider a failure-free, asynchronous message passing network with n links, where the processors are arranged on a ring or a chain. The processors are identically programmed bu...