Sciweavers

17541 search results - page 3183 / 3509
» Complexity in scalable computing
Sort
View
TCOM
2011
92views more  TCOM 2011»
15 years 1 months ago
Bit-Interleaved Coded Modulation with Mismatched Decoding Metrics
Bit-interleaved coded modulation (BICM) has become the de facto coding standard for communication systems. Recently, BICM has been cast as a mismatched decoding scheme due to the ...
Trung Thanh Nguyen 0001, Lutz H.-J. Lampe
TIT
2011
131views more  TIT 2011»
15 years 1 months ago
On the Hardness of Approximating the Network Coding Capacity
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...
Michael Langberg, Alexander Sprintson
TIT
2011
125views more  TIT 2011»
15 years 1 months ago
Unidirectional Chosen-Ciphertext Secure Proxy Re-Encryption
Abstract. In 1998, Blaze, Bleumer, and Strauss proposed a cryptographic primitive called proxy re-encryption, in which a proxy transforms – without seeing the corresponding plain...
Benoît Libert, Damien Vergnaud
TVCG
2011
126views more  TVCG 2011»
15 years 1 months ago
A Comparison of Gradient Estimation Methods for Volume Rendering on Unstructured Meshes
—This paper presents a study of gradient estimation methods for rendering unstructured-mesh volume data. Gradient estimation is necessary for rendering shaded isosurfaces and spe...
Carlos D. Correa, Robert Hero, Kwan-Liu Ma
COGSR
2011
105views more  COGSR 2011»
15 years 1 months ago
Inductive rule learning on the knowledge level
We present an application of the analytical inductive programming system Igor to learning sets of recursive rules from positive experience. We propose that this approach can be us...
Ute Schmid, Emanuel Kitzelmann
« Prev « First page 3183 / 3509 Last » Next »