Sciweavers

119 search results - page 18 / 24
» On the Complexity of Optimal Grammar-Based Compression
Sort
View
LATA
2010
Springer
14 years 2 months ago
Choosing Word Occurrences for the Smallest Grammar Problem
The smallest grammar problem - namely, finding a smallest context-free grammar that generates exactly one sequence - is of practical and theoretical importance in fields such as ...
Rafael Carrascosa, François Coste, Matthias...
CCIW
2009
Springer
14 years 2 months ago
An Improved Image Re-indexing Technique by Self Organizing Motor Maps
The paper presents a novel Motor Map neural network for re-indexing color mapped images. The overall learning process is able to smooth the local spatial redundancy of the indexes ...
Sebastiano Battiato, Francesco Rundo, Filippo Stan...
GECCO
2009
Springer
104views Optimization» more  GECCO 2009»
14 years 2 months ago
Sustaining diversity using behavioral information distance
Conventional similarity metrics used to sustain diversity in evolving populations are not well suited to sequential decision tasks. Genotypes and phenotypic structure are poor pre...
Faustino J. Gomez
ICIP
2010
IEEE
13 years 5 months ago
Complexity-scalable H.264/AVC in an IPP-based video encoder
Real-time high-definition video encoding is a computationhungry task that challenges software-based solutions. For that, in this work we adopted an Intel software implementation o...
Tiago A. da Fonseca, Ricardo L. de Queiroz, Debarg...
ICIP
2001
IEEE
14 years 9 months ago
Prescient mode selection for robust video coding
In standard predictive video coders, intra-mode coding of macroblocks (MBs) provides packet loss resilience, at the cost of reduced compression efficiency. Conventional mode selec...
Rui Zhang, Shankar L. Regunathan, Kenneth Rose