Sciweavers

1511 search results - page 250 / 303
» Randomness, lowness and degrees
Sort
View
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
15 years 6 months ago
Locally Testable Codes Require Redundant Testers
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman...
MICRO
2008
IEEE
103views Hardware» more  MICRO 2008»
15 years 6 months ago
Testudo: Heavyweight security analysis via statistical sampling
Heavyweight security analysis systems, such as taint analysis and dynamic type checking, are powerful technologies used to detect security vulnerabilities and software bugs. Tradi...
Joseph L. Greathouse, Ilya Wagner, David A. Ramos,...
VTC
2008
IEEE
160views Communications» more  VTC 2008»
15 years 6 months ago
Reducing Feedback Requirements of the Multiple Weight Opportunistic Beamforming Scheme via Selective Multiuser Diversity
—Opportunistic beamforming (OB) relies on the transmission of Channel State Information (CSI) in the form of instantaneous Signal to Noise Ratio (SNR) from Mobile Stations (MSs) ...
Marios Nicolaou, Angela Doufexi, Simon Armour
SECON
2007
IEEE
15 years 6 months ago
OPERA: An Optimal Progressive Error Recovery Algorithm for Wireless Sensor Networks
—Wireless Sensor Networks (WSNs) require robustness against channel induced errors while retransmission based schemes prove too costly for energy constrained sensor nodes. Channe...
Saad B. Qaisar, Hayder Radha
IPPS
2006
IEEE
15 years 5 months ago
Algorithm-based checkpoint-free fault tolerance for parallel matrix computations on volatile resources
As the desire of scientists to perform ever larger computations drives the size of today’s high performance computers from hundreds, to thousands, and even tens of thousands of ...
Zizhong Chen, Jack Dongarra