Sciweavers

716 search results - page 33 / 144
» Algorithmic Issues in Coding Theory
Sort
View
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
15 years 9 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
DLT
2004
15 years 3 months ago
An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars
There is a close relationship between formal language theory and data compression. Since 1990's various types of grammar-based text compression algorithms have been introduced...
Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
110
Voted
ICIP
2007
IEEE
15 years 8 months ago
Graph-Cut Rate Distortion Algorithm for Contourlet-Based Image Compression
The geometric features of images, such as edges, are difficult to represent. When a redundant transform is used for their extraction, the compression challenge is even more dif...
Maria Trocan, Béatrice Pesquet-Popescu, Jam...
125
Voted
ICASSP
2008
IEEE
15 years 8 months ago
Multimodal information fusion using the iterative decoding algorithm and its application to audio-visual speech recognition
The fusion of information from heterogenous sensors is crucial to the effectiveness of a multimodal system. Noise affect the sensors of different modalities independently. A good ...
Shankar T. Shivappa, Bhaskar D. Rao, Mohan M. Triv...
105
Voted
AI
1998
Springer
15 years 2 months ago
GAS, A Concept on Modeling Species in Genetic Algorithms
This paper introduces a niching technique called GAS (S stands for species) which dynamically creates a subpopulation structure (taxonomic chart) using a radius function instead of...
Márk Jelasity, József Dombi