Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
3
search results - page 1 / 1
»
Huffman coding with unequal letter costs
Sort
relevance
views
votes
recent
update
View
thumb
title
75
Voted
STOC
2002
ACM
96
views
Algorithms
»
more
STOC 2002
»
Huffman coding with unequal letter costs
16 years 3 months ago
Download
www.cs.ust.hk
Mordecai J. Golin, Claire Kenyon, Neal E. Young
claim paper
Read More »
98
Voted
DCC
2006
IEEE
86
views
Computer Graphics
»
more
DCC 2006
»
Faster Algorithm for Designing Optimal Prefix-Free Codes with Unequal Letter Costs
15 years 6 months ago
Download
www.cs.ust.hk
Abstract. We address the problem of designing optimal prefix-free codes over an encoding alphabet with unequal integer letter costs. The most efficient algorithm proposed so far ha...
Sorina Dumitrescu
claim paper
Read More »
93
click to vote
ISAAC
2007
Springer
98
views
Algorithms
»
more
ISAAC 2007
»
More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding
15 years 9 months ago
Download
www.cs.umd.edu
Mordecai J. Golin, Jian Li
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »