524 search results - page 55 / 105 » An Optimal Lower Bound on the Communication Complexity of Ga... |
SP
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract--We consider resource-constrained broadcast authentication for n receivers in a static, known network topology. There are only two known broadcast authentication protocols...
TCC
2010
Springer
14 years 4 months ago
2010
Springer
Goldreich-Krawczyk (Siam J of Comp’96) showed that only languages in BPP have constant-round public-coin black-box zero-knowledge protocols. We extend their lower bound to “ful...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
— This paper addresses a low complexity frequency offset estimator for multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems over freque...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
—This paper studies the maximum throughput that can be supported by a given wireless mesh backhaul network, over a practical CSMA/CA medium access control (MAC) protocol. We reso...