Buscar
Mostrando ítems 1-10 de 60
Shannon entropy estimation in infinity-alphabets from convergence results: studying plug-in estimators
(MDPI, 2018-06)
This work addresses the problem of Shannon entropy estimation in countably infinite alphabets studying and adopting some recent convergence results of the entropy functional, which is known to be a discontinuous function ...
Universal weak variable-length source coding on countably infinite alphabets
(Institute of Electrical and Electronics Engineers, 2020)
Motivated from the fact that universal source coding on countably infinite alphabets (infinity-alphabets) is not feasible, this work introduces the notion of "almost lossless source coding". Analog to the weak variable-length ...
The wavelet matrix: An efficient wavelet tree for large alphabets
(Elsevier, 2015)
The wavelet tree is a flexible data structure that permits representing sequences S[1, n] of symbols over an alphabet of size sigma, within compressed space and supporting a wide range of operations on S. When sigma is ...
Revealing non-alphabetical guises of spam-trigger vocables
(Universidad Nacional de Colombia Sede Medellín, 2013)
Unsolicited bulk email (spam) nowadays accounts for nearly 75% of daily email traffic, a figure that speaks strongly for the need of finding better protection mechanisms against its dissemination. A clever trick recently ...
First Huffman, then Burrows-Wheeler: A Simple Alphabet-Independent FM-Index
(2014-01-08)
We design a succinct full-text index based on the idea of Huffman-compressing the text and
then applying the Burrows-Wheeler transform over it. The resulting structure can be searched as an
FM-index, with the benefit of ...
Adaptive computation of the swap-insert correction distance
(Association for Computing Machinery, 2018)
The Swap-Insert Correction distance from a string S of length n to another string L of length m≥n on the alphabet [1.δ] is the minimum number of insertions, and swaps of pairs of adjacent symbols, converting S into L. ...
ОБУЧЕНИЕ АЛФАВИТУ НА ОСНОВЕ КИРИЛЛИЦЫ В КОЛУМБИИ
(Universidad Nacional de Colombia - Sede Bogotá - Facultad de Ciencias Humanas - Departamento de Lenguas Extranjeras, 2013-01-01)
Эта работа относится к преподаванию алфавита, основанного на кириллице, студентам Национального Университета Колумбии в Боготе с применением местной топонимии (департаменты Кундинамарка и Бойяка) по методу американского ...
Bit-parallel witnesses and their applications to approximate string matching
(SPRINGER, 2005-01)
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM (Myers, 1999), searches for a pattern of length m in a text of length n permitting k differences ...
Finding submasses in weighted strings with Fast Fourier Transform
(2007)
We study the Submass Finding Problem: given a string s over a weighted alphabet, i.e., an alphabet Sigma with a weight function mu : Sigma -> N, we refer to a mass M is an element of N as a submass of s if s has a substring ...
Reconocimiento del abecedario de la lengua de señas colombiana con Redes Neuronales Convolucionales
(Universidad de los Llanos, 2021-06-16)
El lenguaje de señas brinda un sistema para que las personas con discapacidad oral/auditiva se comuniquen efectivamente. Sin embargo, aún falta para que el resto de la sociedad se apropie de este conocimiento. Este trabajo ...