A fast algorithm for constructing nearly optimal prefix codes
Author:
Affiliation:
1. Department of Electronics and Systems; University of A Coruña; A Coruña 15011 Spain
Publisher
Wiley
Subject
Software
Link
http://onlinelibrary.wiley.com/wol1/doi/10.1002/spe.2375/fullpdf
Reference25 articles.
1. A method for construction of minimal redundancy codes;Huffman;Proceedings of the IRE,1951
2. van Leeuwen J On the construction of Huffman trees Proc. 3Rd Int. Colloquium On Automata, Languages And Programming Edinburgh 1976
3. chap. 6;Crochemore,1996
4. CPPC: A compiler-assisted tool for portable checkpointing of message-passing applications;Rodríguez;Concurrency and Computation: Practice and Experience,2010
5. Iskra K Romein JW Yoshii K Beckman P Zoid: I/O-forwarding infrastructure for petascale architectures ACM SIGPLAN Symp. On Principles and Practice of Parallel Programming Salt Lake City, UT, USA 2008 153 162
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3