|  |
| Ìîäåëè â êîìïðåññèè. Ðàçëè÷íûå àëãîðèòìû ñæàòèÿ z i p
Îáùèé îáçîð ìåòîäîâ êîìïðåññèè è ìîäåëåé. Äàíû îñíîâíûå ïðèíöèïû ðàáîòû ìíîãèõ èçâåñòíûõ àëãîðèòìîâ.
|
| Experiments on the Zero Frequency Problem z i p
The focus of this paper is the problem of transforming the set of counts accumulated for a particular context into a probability distribution. Äîâîëüíî èíòåðåñíûå îáùèå ðàññóæäåíèÿ áåç êîíêðåòíûõ àëãîðèòìîâ.
|
| Fast Text Compression Based on Quasi-Arithmetic Code z i p
Îïèñàí ìåòîä ñæàòèÿ èíôîðìàöèè, ëèøü íåìíîãî óñòóïàþùèé PPMC â ñæàòèè, íî ñèëüíî ïðåâîñõîäÿùèé ïî ñêîðîñòè.
|
| Range encoding: an algorithm for removing redundancy z i p
Àëãîðèòì äëÿ óñòðàíåíèÿ èçáûòî÷íîñòè ñîîáùåíèÿ. Áîëüøå èíòåðåñíî òåîðåòè÷åñêè, íåæåëè äëÿ ïðàêòèêè.
|
| Sub-Linear Decoding of Huffman Codes Almost in-place z i p
Ñóáëèíåéíîå äåêîäèðîâàíèå Õàôôìàíà, òðåáóþùåå â íåñêîëüêî ðàç ìåíüøå ïàìÿòè, íåæåëè îáû÷íûå ðåàëèçàöèè.
|
| Flexible Parsing for Dynamic Dictionary Based Compression z i p
Óëó÷øåíèå îáû÷íîãî 'æàäíîãî' ïàðñèíãà, çàãëÿäûâàþùåå íàçàä. Êàê ðåçóëüòàò - íà 35% óëó÷øåíèå ïî ñðàâíåíèþ ñ îáû÷íûì dynamic dictionary compression â gzip è compress.
|
| A Rapid Entropy-Coding Algorithm z i p
Àëãîðèòì entropy coding, ñðàâíèìûé ïî áûñòðîäåéñòâèþ è ñêîðîñòè ñ Q- è QM-coder. Ñ èñõîäíèêàìè íà Ñè.
|
| Using Neural Networks for Nonlinear Predictive Coding z i p
Èñïîëüçîâàíèå íåéðîííûõ ñåòåé äëÿ àäàïòèâíîãî ñæàòèÿ èíôîðìàöèè. Ñ èñõîäíèêàìè.
|
| A Generalization and Improvement to PPM's 'Blending' z i p
Óëó÷øåíèå îäíîãî èç íàèáîëåå ìîùíûõ ìåòîäîâ àäàïòèâíîé êîìïðåññèè - PPM blending.
|
