Sparse Sequential Dirichlet Coding
| dc.contributor.author | Veness, Joel | en_AU |
| dc.contributor.author | Hutter, Marcus | en_AU |
| dc.date.accessioned | 2015-08-24T02:20:12Z | |
| dc.date.available | 2015-08-24T02:20:12Z | |
| dc.date.created | 2012-06 | en_AU |
| dc.description.abstract | This short paper describes a simple coding technique, Sparse Sequential Dirichlet Coding, for multi-alphabet memoryless sources. It is appropriate in situations where only a small, unknown subset of the possible alphabet symbols can be expected to occur in any particular data sequence. We provide a competitive analysis which shows that the performance of Sparse Sequential Dirichlet Coding will be close to that of a Sequential Dirichlet Coder that knows in advance the exact subset of occurring alphabet symbols. Empirically we show that our technique can perform similarly to the more computationally demanding Sequential Sub-Alphabet Estimator, while using less computational resources. | en_AU |
| dc.format.extent | 1 vol. | en_AU |
| dc.format.mimetype | application/pdf | en_AU |
| dc.identifier.uri | http://hdl.handle.net/1885/14899 | |
| dc.language.iso | en_AU | en_AU |
| dc.rights | © The Author(s) | en_AU |
| dc.source.uri | http://arxiv.org/abs/1206.3618 | en_AU |
| dc.title | Sparse Sequential Dirichlet Coding | en_AU |
| dc.type | Working/Technical Paper | en_AU |
| local.bibliographicCitation.lastpage | 7 | en_AU |
| local.bibliographicCitation.startpage | 1 | en_AU |
| local.contributor.affiliation | Hutter, M., Research School of Computer Science, The Australian National University | en_AU |
| local.contributor.authoruid | u4350841 | en_AU |
| local.description.embargo | 2037-12-31 | |
| local.publisher.url | http://arxiv.org/ | en_AU |
| local.type.status | Published Version | en_AU |