Lower bounding the optimal LZ78-parsing

Página do item simplificado
dc.contributor.authorPinho, M. S. [UNESP]
dc.contributor.authorFinamore, W. A. [UNESP]
dc.contributor.institutionUniversidade Estadual Paulista (UNESP)
dc.date.accessioned2022-04-28T18:54:33Z
dc.date.available2022-04-28T18:54:33Z
dc.date.issued2001-01-01
dc.description.abstractA simple sequential algorithm that can compute a lower bound to the number of phrases produced by the optimal parsing procedure was developed and tested. Results were compared to the number of phrases produced by two versions of the LZ78: LZW and the algorithm ll-LZ78. Results show that the lower bound is close to the number of phrases of those versions.en
dc.description.affiliationUniversidade Estadual Paulista, Guaratinguetá - S.P.
dc.description.affiliationUnespUniversidade Estadual Paulista, Guaratinguetá - S.P.
dc.format.extent513
dc.identifier.citationData Compression Conference Proceedings, p. 513-.
dc.identifier.issn1068-0314
dc.identifier.scopus2-s2.0-0035007208
dc.identifier.urihttp://hdl.handle.net/11449/219246
dc.language.isoeng
dc.relation.ispartofData Compression Conference Proceedings
dc.sourceScopus
dc.titleLower bounding the optimal LZ78-parsingen
dc.typeTrabalho apresentado em evento

Arquivos

Coleções

Artigos