Buscar
Mostrando ítems 1-10 de 12
Comparação entre os algoritmos de codificação Huffman e Lempel-Ziv para compressão de sinais de áudio após a filtragem
(Universidade Federal de UberlândiaBrasilEngenharia de Eletrônica e Telecomunicações, 2018)
Lempel-ziv compressed full-text self-indexes.
(2008)
Text searching is a classical problem in Computer Science. Given a sequence of symbois T[1..u], thc text, over an alphabet E = {1,... ,r} of size a, anci given another (short)
sequence P[1,.rn], the search pattern, also ...
Codificação de fonte
(Universidade Estadual Paulista (Unesp), 2014-03-21)
This work consists of a study about the basic principles of source coding. In this sense we develop the basics of data source, information and entropy, requirements to present the Shannon's Source Coding Theorem as well ...
Teoría de la información, códigos y aplicaciones de la geometría algebraica
(Quito: USFQ, 2012)
Codificação de fonte
(Universidade Estadual Paulista (UNESP), 2014)
Codificação de fonte
(Universidade Estadual Paulista (Unesp), 2014)
Compressed suffix trees for repetitive collections based on block trees
(Universidad de Chile, 2019)
The Block Tree is a recently proposed data structure representing a sequence T of length n in space bounded by the number of phrases z of the Lempel-Ziv parsing of T. It uses O(z log(n/z)) space and supports access to ...
Metodos universais de compreensão de dados
([s.n.], 1991)