Sciweavers

2658 search results - page 36 / 532
» On efficient balanced codes
Sort
View
ICASSP
2011
IEEE
13 years 26 days ago
Efficient context adaptive entropy coding for real-time applications
Context based entropy coding has the potential to provide higher gain over memoryless entropy coding. However serious difficulties arise regarding the practical implementation in...
Guillaume Fuchs, Vignesh Subbaraman, Markus Multru...
JVCIR
2006
92views more  JVCIR 2006»
13 years 9 months ago
Overview of H.264/MPEG-4 part 10
The video coding standards are being developed to satisfy the requirements of applications for various purposes, better picture quality, higher coding efficiency, and more error r...
Soon-kak Kwon, A. Tamhankar, K. R. Rao
CORR
2007
Springer
71views Education» more  CORR 2007»
13 years 9 months ago
The PBD-Closure of Constant-Composition Codes
—We show an interesting pairwise balanced design (PBD)-closure result for the set of lengths of constant-composition codes whose distance and size meet certain conditions. A cons...
Yeow Meng Chee, Alan C. H. Ling, San Ling, Hao She...
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
14 years 1 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
MASCOTS
2008
13 years 10 months ago
Tackling the Memory Balancing Problem for Large-Scale Network Simulation
A key obstacle to large-scale network simulation over PC clusters is the memory balancing problem where a memory-overloaded machine can slow down an entire simulation due to disk ...
Hyojeong Kim, Kihong Park