Sciweavers

5962 search results - page 292 / 1193
» Working with Patterns and Code
Sort
View
CCS
2008
ACM
15 years 6 months ago
VEP: a virtual machine for extended proof-carrying code
One of the key issues with the practical applicability of Proof-Carrying Code (PCC) and its related methods is the difficulty in communicating the proofs which are inherently larg...
Heidar Pirzadeh, Danny Dubé
SODA
2008
ACM
144views Algorithms» more  SODA 2008»
15 years 6 months ago
Fast dimension reduction using Rademacher series on dual BCH codes
The Fast Johnson-Lindenstrauss Transform (FJLT) was recently discovered by Ailon and Chazelle as a novel technique for performing fast dimension reduction with small distortion fr...
Nir Ailon, Edo Liberty
ICASSP
2010
IEEE
15 years 5 months ago
Multipoint-to-point and point-to-multipoint space-time network coding
Traditional cooperative communications can improve communication reliability. However, the simultaneous transmissions from multiple relays are challenging in practice due to the i...
Hung-Quoc Lai, K. J. Ray Liu
CORR
2006
Springer
79views Education» more  CORR 2006»
15 years 4 months ago
Source coding and channel requirements for unstable processes
Our understanding of information in systems has been based on the foundation of memoryless processes. Extensions to stable Markov and auto-regressive processes are classical. Berg...
Anant Sahai, Sanjoy K. Mitter
TIT
2002
78views more  TIT 2002»
15 years 4 months ago
Tradeoffs between the excess-code-length exponent and the excess-distortion exponent in lossy source coding
Lossy compression of a discrete memoryless source (DMS) with respect to a single-letter distortion measure is considered. We study the best attainable tradeoff between the exponent...
Tsachy Weissman, Neri Merhav