Сжатие данных
Категория реферата: Рефераты по информатике, программированию
Теги реферата: тарас бульба сочинение, курсовики скачать бесплатно
Добавил(а) на сайт: Дементий.
1 2 | Следующая страница реферата
Литература.
1. Bently,J.l., Sleator,D.D., Tarjan,R.E., and Wei,V.K.
A locally adaptive data compression scheme.
Communications of the ACM. 29, 4 ( Apr. 1986 ), 320-330.
2. Gallagen,R.G.
Information Theory and Reliable Communication.
John Wiley & Sons, New York, 1968.
3. Gallager,R.G.
Variations on a theme by Huffman.
IEEE Trans.Inform.Theory IT-24, 6 ( Nov.1978 ), 666-674.
4. Jones,D.W.
An empirical comparison of priority queue and set inplementations.
Communication of the ACM. 29, 4 ( Apr. 1986 ), 300-311.
5. Knuth,D.E.
Dynamic Huffman coding.
J.Algorithms 6, 2 ( Feb. 1985 ), 163-180.
6. Rubin,F.
Arithmetic stream coding using fixed precision registers.
IEEE Trans.Inform.Theory IT-25, 6 ( Nov. 1979 ), 672-675.
7. Saraswat,V.
Merge trees using splaying - or how to splay in parralel and bottom-up.
PROLOG Digest 5, 22 ( Mar. 27, 1987 ).
8. Sleator,D.D., and Tarjan,R.E.
Self-adjusting binary trees.
In Proceedings of the ACM SIGACT Symposium on Theory of Computing
( Boston, Mass., Apr.25-27 ).ACM, New York, 1983, pp.235-245.
9. Tarjan,R.E., and Sleator,D.D.
Self-adjusting binary search trees.
J.ACM 32, 3 ( July 1985 ), 652-686.
10. Vitter,J.S.
Two papers on dynamic Huffman codes.
Tech.Rep.CS-85-13.Brown University Computer Science,
R.I. Revised Dec.1986.
11. Welch,T.A.
A technique for high-performance data compression.
Рекомендуем скачать другие рефераты по теме: творчество реферат, бесплатно решебник.
1 2 | Следующая страница реферата