Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Danny Dube"'
Publikováno v:
Recercat. Dipósit de la Recerca de Catalunya
instname
DCC
Recercat: Dipósit de la Recerca de Catalunya
Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
instname
DCC
Recercat: Dipósit de la Recerca de Catalunya
Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
Marlin [1] is a Variable-to-Fixed (VF) codec optimized for decoding speed. To achieve its speed, Marlin does not encode the current state of the input source, penalyzing compression ratio. In this paper we address this penalty by partially encoding t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ef315c41edec7d0f02eaab2bc39c8333
http://hdl.handle.net/2072/449677
http://hdl.handle.net/2072/449677
Autor:
Danny Dube
Publikováno v:
DCC
We propose a technique that performs entropy coding by splitting lexicographic intervals. The main characteristics of our technique are that it is: based on automata quite similar to Mealy machines; fast in encoding and decoding; able to achieve arbi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b8ea82157780d079d9b07111cd7eb7c4
https://doi.org/10.1109/dcc47342.2020.00096
https://doi.org/10.1109/dcc47342.2020.00096
Autor:
Danny Dube
Publikováno v:
ISPA
Originally, compression by substring enumeration (CSE) is a lossless compression technique that is intended for strings of bits. As such, the original version is one-dimensional. An extension of CSE for strings drawn from a larger alphabet has later
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0772a567e91f9a4994c93d07d9d81be3
https://doi.org/10.1109/ispa.2019.8868744
https://doi.org/10.1109/ispa.2019.8868744
Autor:
Danny Dube, Hidetoshi Yokoo
Publikováno v:
ISIT
A crucial task in the design of an efficient ANS encoder consists in choosing a favourable symbol distribution. This task seems to be hard, due to its combinatorial nature, in particular for the tANS variant of ANS, which is the focus of this work. W
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ca1dc48c3ad68e08d6580a2a6a9071c3
https://doi.org/10.1109/isit.2019.8849430
https://doi.org/10.1109/isit.2019.8849430
Autor:
Danny Dube
Publikováno v:
ISITA
Recently, Dube and Mechqrane presented a construction technique to encode plain data into balanced codewords. The construction is based on permutations, the well known arcade game Pacman, and limited-precision integers. The redundancy that is introdu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::49223a5ec27334d4a3d64853ed96de08
https://doi.org/10.23919/isita.2018.8664368
https://doi.org/10.23919/isita.2018.8664368
Autor:
Danny Dube, Fatma Haddad
Publikováno v:
ISIT
Variable-to-fixed (VF) codes are often based on dictionaries that obey the prefix-free property; e.g., the Tunstall codes. However, correct VF codes need not be prefix free. Removing that constraint may offer the opportunity to build more efficient c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::52db6fd04e3f2f1f81fda0f5d4a64f6a
https://doi.org/10.1109/isit.2018.8437665
https://doi.org/10.1109/isit.2018.8437665
Autor:
Danny Dube, Fatma Haddad
Publikováno v:
DCC
Variable-to-fixed codes are often based on dictionaries that obey the prefix-free property. In particular, the Tunstall algorithm builds such codes. However, the prefix-free property is not necessary to have correct variable-to-fixed codes. Removing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b4b1f883995be84a332efe62fb5cd71e
https://doi.org/10.1109/dcc.2018.00058
https://doi.org/10.1109/dcc.2018.00058
Publikováno v:
Information and Computation. 239:13-28
The notion of recognition of a language by a finite semigroup can be generalized to recognition by finite groupoids, i.e. sets equipped with a binary operation '?' which is not necessarily associative. It is well known that L can be recognized by a g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a56621b04780b52c778017fc0666e540
https://doi.org/10.1016/j.ic.2014.08.005
https://doi.org/10.1016/j.ic.2014.08.005
Autor:
Mounir Mechqrane, Danny Dube
Publikováno v:
CWIT
We present a technique based on permutations, the well known arcade game Pacman, and limited-precision integers to encode data into balanced codewords. The redundancy that is introduced by the encoding is particularly low. The results are noticeably
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::65ae9a27c96afd1b5eb5150d903a16e5
https://doi.org/10.1109/cwit.2017.7994820
https://doi.org/10.1109/cwit.2017.7994820
Publikováno v:
ISSPIT
The bit recycling compression technique has been introduced to minimize the redundancy caused by the multiplicity of encodings present in many compression techniques. It has achieved about 9% as a reduction in the size of the files compressed by Gzip
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::045e97cfcdb0420544cee1c53540391c
https://doi.org/10.1109/isspit.2015.7394382
https://doi.org/10.1109/isspit.2015.7394382