524 search results - page 62 / 105 » An Optimal Lower Bound on the Communication Complexity of Ga... |
TCC
2009
Springer
14 years 8 months ago
2009
Springer
We address one of the foundational problems in cryptography: the bias of coin-flipping protocols. Coin-flipping protocols allow mutually distrustful parties to generate a common u...
ASPDAC
2009
ACM
14 years 2 months ago
2009
ACM
The Leading Zero Anticipator (LZA) is one of the main components used in floating point addition. It tends to be on the critical path, so it has attracted the attention of many r...
ICC
2009
IEEE
14 years 2 months ago
2009
IEEE
—We consider a system with a single base station communicating with multiple users over orthogonal channels while being assisted by multiple relays. Several recent works have sug...
MOBIHOC
2009
ACM
14 years 8 months ago
2009
ACM
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
Outage and error rate performance of the ordered BLAST with more than 2 transmit antennas is evaluated for i.i.d. Rayleigh fading channels. A number of lower and upper bounds on th...