Sciweavers

9562 search results - page 1901 / 1913
» The probability of
Sort
View
ECCC
2011
204views ECommerce» more  ECCC 2011»
13 years 1 months ago
Dense locally testable codes cannot have constant rate and distance
A q-query locally testable code (LTC) is an error correcting code that can be tested by a randomized algorithm that reads at most q symbols from the given word. An important questi...
Irit Dinur, Tali Kaufman
FOCM
2011
188views more  FOCM 2011»
13 years 1 months ago
Compressive Wave Computation
This paper considers large-scale simulations of wave propagation phenomena. We argue that it is possible to accurately compute a wavefield by decomposing it onto a largely incomp...
Laurent Demanet, Gabriel Peyré
ICALP
2011
Springer
13 years 1 months ago
New Algorithms for Learning in Presence of Errors
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
Sanjeev Arora, Rong Ge
ICS
2011
Tsinghua U.
13 years 1 months ago
High performance linpack benchmark: a fault tolerant implementation without checkpointing
The probability that a failure will occur before the end of the computation increases as the number of processors used in a high performance computing application increases. For l...
Teresa Davies, Christer Karlsson, Hui Liu, Chong D...
ICUIMC
2011
ACM
13 years 1 months ago
Opportunities of MIM capture in IEEE 802.11 WLANs: analytic study
Physical layer capture in WLANs makes a receiver to decode a relatively strong packet in a collision. According to recent works, an augmented physical layer capture handles interf...
Joonsoo Lee, Young-myoung Kang, Suchul Lee, Chong-...
« Prev « First page 1901 / 1913 Last » Next »