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...
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...
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...
To probe network characteristics, two predominant ways of network comparison are global property statistics and subgraph enumeration. However, they suffer from limited information...
The computation of triangular decompositions involves two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new...