524 search results - page 30 / 105 » An Optimal Lower Bound on the Communication Complexity of Ga... |
CSFW
2009
IEEE
15 years 6 months ago
2009
IEEE
Multi-party contract signing protocols specify how a number of signers can cooperate in achieving a fully signed contract, even in the presence of dishonest signers. This problem h...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
We present a faster exponential-time algorithm for integer optimization over quasi-convex polynomials. We study the minimization of a quasiconvex polynomial subject to s quasi-con...
IPPS
2000
IEEE
15 years 4 months ago
2000
IEEE
All-to-all personalized exchange is one of the most dense collective communication patterns and occurs in many important parallel computing/networking applications. In this paper,...
107
click to vote
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
— 1 In this paper, pilot-assisted transmission over Gauss-Markov Rayleigh fading channels is considered. A simple scenario, where a single pilot signal is transmitted every T sym...
194
click to vote
ICDT
2009
ACM
16 years 16 days ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...