2924 search results - page 281 / 585 » Lower Bounds in Distributed Computing |
128
click to vote
IPPS
2008
IEEE
15 years 10 months ago
2008
IEEE
Providing point-to-point messaging-passing semantics atop Put/Get hardware traditionally involves implementing a protocol comprising three network latencies. In this paper, we ana...
118
click to vote
IPPS
2003
IEEE
15 years 9 months ago
2003
IEEE
The dual-cube is a newly proposed topology for interconnection networks, which uses low dimensional hypercubes as building blocks. The primary advantages of the dual-cube over the...
134
click to vote
FOCS
2005
IEEE
15 years 10 months ago
2005
IEEE
We consider the problem of learning mixtures of arbitrary symmetric distributions. We formulate sufficient separation conditions and present a learning algorithm with provable gua...
143
click to vote
SIGECOM
2009
ACM
15 years 10 months ago
2009
ACM
In the context of auctions for digital goods, an interesting Random Sampling Optimal Price auction (RSOP) has been proposed by Goldberg, Hartline and Wright; this leads to a truth...
112
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
ABSTRACT. A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces...