Sciweavers

848 search results - page 151 / 170
» Randomness and the linear degrees of computability
Sort
View
VTC
2010
IEEE
122views Communications» more  VTC 2010»
14 years 10 months ago
Generalized MIMO Transmit Preprocessing Using Pilot Symbol Assisted Rateless Codes
In this paper, we propose a generalized multiple-input multiple-output (MIMO) transmit preprocessing system, where both the channel coding and the linear MIMO transmit precoding c...
Nicholas Bonello, Du Yang, Shen Chen, Lajos Hanzo
STOC
2001
ACM
104views Algorithms» more  STOC 2001»
16 years 2 days ago
Spatial gossip and resource location protocols
The dynamic behavior of a network in which information is changing continuously over time requires robust and efficient mechanisms for keeping nodes updated about new information. ...
David Kempe, Jon M. Kleinberg, Alan J. Demers
APPROX
2007
Springer
160views Algorithms» more  APPROX 2007»
15 years 6 months ago
Better Binary List-Decodable Codes Via Multilevel Concatenation
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
Venkatesan Guruswami, Atri Rudra
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
15 years 5 months ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
15 years 4 months ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman