Sciweavers

971 search results - page 11 / 195
» Comparative Analysis of Arithmetic Coding Computational Comp...
Sort
View
CORR
2006
Springer
151views Education» more  CORR 2006»
13 years 7 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
ICIP
2004
IEEE
14 years 9 months ago
Scalable video coding based on motion-compensated temporal filtering: complexity and functionality analysis
Video coding techniques yielding state-of-the-art compression performance require large amount of computational resources, hence practical implementations, which target a broad ma...
Fabio Verdicchio, Yiannis Andreopoulos, Tom Clerck...
DCC
2006
IEEE
14 years 7 months ago
Low-Complexity Compression of Short Messages
We describe a low-complexity scheme for lossless compression of short text messages. The method uses arithmetic coding and a specific statistical context model for prediction of s...
Stephan Rein, Clemens Gühmann, Frank H. P. Fi...
COMPLEX
2009
Springer
14 years 2 months ago
Comparing Networks from a Data Analysis Perspective
To probe network characteristics, two predominant ways of network comparison are global property statistics and subgraph enumeration. However, they suffer from limited information...
Wei Li, Jing-Yu Yang
ISSAC
2009
Springer
169views Mathematics» more  ISSAC 2009»
14 years 2 months ago
Computations modulo regular chains
The computation of triangular decompositions involves two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new...
Xin Li, Marc Moreno Maza, Wei Pan