Sciweavers

2060 search results - page 44 / 412
» Some Applications of Coding Theory in Computational Complexi...
Sort
View
TCSV
2010
14 years 4 months ago
M-Channel Multiple Description Coding With Two-Rate Coding and Staggered Quantization
A low complexity M-channel multiple description coding scheme is developed in this paper, in which each description carries one subset of the input with a higher bit rate and the r...
Upul Samarawickrama, Jie Liang, Chao Tian
ISCAS
2006
IEEE
106views Hardware» more  ISCAS 2006»
15 years 3 months ago
An efficient SNR scalability coding framework hybrid open-close loop FGS coding
Abstract—This paper presents a novel high-efficient hybrid openclose loop based fine granularity scalable (HOCFGS) coding framework supporting different decoding complexity appli...
Xiangyang Ji, Debin Zhao, Wen Gao, Jizheng Xu, Fen...
CORR
2008
Springer
141views Education» more  CORR 2008»
14 years 9 months ago
Distributed Source Coding using Abelian Group Codes
In this work, we consider a distributed source coding problem with a joint distortion criterion depending on the sources and the reconstruction. This includes as a special case the...
Dinesh Krithivasan, S. Sandeep Pradhan
SPAA
2009
ACM
15 years 4 months ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
15 years 4 months ago
Increasing the Gap between Descriptional Complexity and Algorithmic Probability
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
Adam R. Day