168 search results - page 33 / 34 » Lower Bounds for Distributed Coin-Flipping and Randomized Co... |
ALT
2004
Springer
15 years 6 months ago
2004
Springer
Kernel functions are typically viewed as providing an implicit mapping of points into a high-dimensional space, with the ability to gain much of the power of that space without inc...
108
click to vote
ALGOSENSORS
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we study the connectivity problem for wireless networks under the Signal to Interference plus Noise Ratio (SINR) model. Given a set of radio transmitters distributed ...
84
Voted
SPAA
2004
ACM
15 years 2 months ago
2004
ACM
Parallel disks provide a cost effective way of speeding up I/Os in applications that work with large amounts of data. The main challenge is to achieve as much parallelism as poss...
83
Voted
SIGECOM
2010
ACM
15 years 2 months ago
2010
ACM
We study the problem of selling identical goods to n unit-demand bidders in a setting in which the total supply of goods is unknown to the mechanism. Items arrive dynamically, and...
110
Voted
SPAA
1995
ACM
15 years 1 months ago
1995
ACM
For years, the computation rate of processors has been much faster than the access rate of memory banks, and this divergence in speeds has been constantly increasing in recent yea...