Sciweavers

495 search results - page 51 / 99
» Capacity of Non-Malleable Codes
Sort
View
CASES
2010
ACM
13 years 5 months ago
Fine-grain dynamic instruction placement for L0 scratch-pad memory
We present a fine-grain dynamic instruction placement algorithm for small L0 scratch-pad memories (spms), whose unit of transfer can be an individual instruction. Our algorithm ca...
JongSoo Park, James D. Balfour, William J. Dally
GLOBECOM
2010
IEEE
13 years 5 months ago
Authenticating MIMO Transmissions Using Channel-Like Fingerprinting
Abstract-- A framework for introducing an extrinsic fingerprint signal to space-time coded transmissions at the physical-layer is presented, whereby the fingerprint signal conveys ...
Nate Goergen, W. Sabrina Lin, K. J. Ray Liu, T. Ch...
EJASP
2010
89views more  EJASP 2010»
13 years 2 months ago
Sparsity-Aware Estimation of CDMA System Parameters
The number of active users, their timing offsets, and their (possibly dispersive) channels with the access point are decisive parameters for wireless code division multiple access...
Daniele Angelosante, Emanuele Grossi, Georgios B. ...
JIPS
2010
273views more  JIPS 2010»
13 years 2 months ago
Hiding Secret Data in an Image Using Codeword Imitation
This paper proposes a novel reversible data hiding scheme based on a Vector Quantization (VQ) codebook. The proposed scheme uses the principle component analysis (PCA) algorithm to...
Zhi-Hui Wang, Chin-Chen Chang, Pei-Yu Tsai
INFOCOM
2009
IEEE
14 years 2 months ago
Minimizing Delay for Multicast-Streaming in Wireless Networks with Network Coding
—Network coding is a method that promises to achieve the min-cut capacity in multicasts. However, pushing towards this gain in throughput comes with two sacrifices. Delay suffer...
Wai-Leong Yeow, Anh Tuan Hoang, Chen-Khong Tham