Buscar
Mostrando ítems 1-9 de 86
Lempel–ziv‑like parsing in small space
(Springer, 2020)
Lempel-Ziv (LZ77 or, briefly, LZ) is one of the most effective and widely-used compressors for repetitive texts. However, the existing efficient methods computing the exact LZ parsing have to use linear or close to linear ...
Lempel–Ziv complexity and Shannon entropy-based support vector clustering of ECG signals
(Universidad de Carabobo, 2015-04)
This work presents a Support Vector Machine (SVM)-based clustering method to cluster normal and pathological ECG signals on a Lempel-Ziv (LZ) complexity and Shannon entropy (SE) space. One normal ECG and three ECG signals ...
Smaller and Faster Lempel-Ziv Indices
(2007)
Given a text T[1..u] over an alphabet of size σ = O(polylog(u))
and with k-th order empirical entropy Hk(T), we propose a new compressed
full-text self-index based on the Lempel-Ziv (LZ) compression
algorithm, which ...
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)
Autoíndices Comprimidos para Texto Basados en Lempel-Ziv
(Universidad de ChilePrograma Cybertesis, 2009)
A Lempel-Ziv Text Index on Secondary Storage
(2007)
Full-text searching consists in locating the occurrences of a
given pattern P[1::m] in a text T[1::u], both sequences over an alpha-
bet of size ¾. In this paper we de¯ne a new index for full-text searching
on secondary ...