314 search results - page 31 / 63 » A Comparison of Known Codes, Random Codes, and the Best Code... |
FOCS
2000
IEEE
14 years 1 months ago
2000
IEEE
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...
STOC
2009
ACM
14 years 9 months ago
2009
ACM
We give explicit constructions of epsilon nets for linear threshold functions on the binary cube and on the unit sphere. The size of the constructed nets is polynomial in the dime...
SIGSOFT
2008
ACM
14 years 9 months ago
2008
ACM
Atomicity is an important specification that enables programmers to understand atomic blocks of code in a multi-threaded program as if they are sequential. This significantly simp...
IJNSEC
2007
13 years 8 months ago
2007
McEliece is one of the oldest known public key cryptosystems, however it was not quite as successful as RSA. One main reason is that it is widely believed that code-based cryptosy...
DCC
2007
IEEE
14 years 8 months ago
2007
IEEE
Many scientific, imaging, and geospatial applications produce large high-precision scalar fields sampled on a regular grid. Lossless compression of such data is commonly done usin...