Sciweavers

364 search results - page 5 / 73
» Very Efficient Balanced Codes
Sort
View
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
13 years 12 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
ECCV
2010
Springer
14 years 6 days ago
Efficient Highly Over-Complete Sparse Coding using a Mixture Model
Sparse coding of sensory data has recently attracted notable attention in research of learning useful features from the unlabeled data. Empirical studies show that mapping the data...
ICIP
2005
IEEE
14 years 9 months ago
Efficient coding of computer generated compound images
A new compound image compression algorithm is proposed, based on Shape Primitive Extraction and Coding (SPEC). The SPEC first segments a compound image into text/graphics pixels an...
Tony Lin, Pengwei Hao, Sang Uk Lee
ICASSP
2011
IEEE
12 years 11 months 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...
GRID
2004
Springer
14 years 1 months ago
Self-Organizing Agents for Grid Load Balancing
A computational grid is a wide-area computing environment for cross-domain resource sharing and service integration. Resource management and load balancing are key concerns when i...
Junwei Cao