Sciweavers

40 search results - page 3 / 8
» On the Suboptimality of Linear Lossy Codes
Sort
View
CORR
2006
Springer
151views Education» more  CORR 2006»
14 years 9 months ago
High SNR Analysis for MIMO Broadcast Channels: Dirty Paper Coding vs. Linear Precoding
We study the MIMO broadcast channel and compare the achievable throughput for the optimal strategy of dirty paper coding to that achieved with sub-optimal and lower complexity lin...
Juyul Lee, Nihar Jindal
PPAM
2007
Springer
15 years 3 months ago
New Data Structures for Matrices and Specialized Inner Kernels: Low Overhead for High Performance
Dense linear algebra codes are often expressed and coded in terms of BLAS calls. This approach, however, achieves suboptimal performance due to the overheads associated to such cal...
José R. Herrero
CORR
2008
Springer
115views Education» more  CORR 2008»
14 years 9 months ago
Lower Bounds on the Rate-Distortion Function of LDGM Codes
Abstract-- We analyze the performance of low-density generator matrix (LDGM) codes for lossy source coding. We first develop a generic technique for deriving lower bounds on the ef...
Alexandros G. Dimakis, Martin J. Wainwright, Kanna...
TCSV
2002
67views more  TCSV 2002»
14 years 9 months ago
A new compression scheme for color-quantized images
An efficient compression scheme for color-quantized images based on progressive coding of color information has been developed. Instead of sorting color indexes into a linear list ...
Xin Chen, Sam Kwong, Ju-fu Feng
HEURISTICS
2002
65views more  HEURISTICS 2002»
14 years 9 months ago
Probability Distribution of Solution Time in GRASP: An Experimental Investigation
A GRASP (greedy randomized adaptive search procedure) is a multi-start metaheuristic for combinatorial optimization. We study the probability distributions of solution time to a su...
Renata M. Aiex, Mauricio G. C. Resende, Celso C. R...