WEKO3
アイテム
BSTW Data Compression with PPM
https://ipsj.ixsq.nii.ac.jp/records/120836
https://ipsj.ixsq.nii.ac.jp/records/120836dcf8ac5f-a73a-463b-a11d-906c2445c2ab
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
KJ00001342503.pdf (161.6 kB)
|
|
| Item type | National Convention(1) | |||||
|---|---|---|---|---|---|---|
| 公開日 | 1992-02-24 | |||||
| タイトル | ||||||
| 言語 | en | |||||
| タイトル | BSTW Data Compression with PPM | |||||
| 言語 | ||||||
| 言語 | eng | |||||
| 資源タイプ | ||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_5794 | |||||
| 資源タイプ | conference paper | |||||
| 著者所属(英) | ||||||
| en | ||||||
| Shinshu University | ||||||
| 著者所属(英) | ||||||
| en | ||||||
| shinshu University | ||||||
| 論文抄録(英) | ||||||
| 内容記述タイプ | Other | |||||
| 内容記述 | Algorithm BSTW developed by Bentley, Sleator, Tarjam and Wei is one of the most efficient data compression algorithms. This algorithm takes an advantage of locality of reference, the tendency of words to occur frequently for a short period of time and then fall into long period of disuse. The scheme is based on a self organizing list, for maintaining code table. PPM (Prediction by Partial Matching) in conjunction with Arithmetic coding, first investigated by Cleary and Written and later modified and implemented by Moffat had been also reported of high performance data compression. The algorithm bias probabilities assigned tosymbols according to the immediately preceeding text.In this paper we propose the using of BSTW's idea andemploy PPM to fomulate adaptive data compression model. | |||||
| 書誌レコードID | ||||||
| 収録物識別子タイプ | NCID | |||||
| 収録物識別子 | AN00349328 | |||||
| 書誌情報 |
全国大会講演論文集 巻 第44回, 号 基礎理論及び基礎技術, p. 61-62, 発行日 1992-02-24 |
|||||
| 出版者 | ||||||
| 言語 | ja | |||||
| 出版者 | 情報処理学会 | |||||
