Danny Dubé

Publication Activity (10 Years)

Years Active: 1994-2020
Publications (10 Years): 11

Top Topics

Arithmetic Coding

Minimum Redundancy

Regular Languages

Lossless Compression

Top Venues

Publications

Danny Dubé
Entropy Coders Based on the Splitting of Lexicographic Intervals. DCC (2020)
Danny Dubé, Hidetoshi Yokoo
Fast Construction of Almost Optimal Symbol Distributions for Asymmetric Numeral Systems. ISIT (2019)
Danny Dubé
Lossless Compression of Grayscale and Colour Images Using Multidimensional CSE. ISPA (2019)
Danny Dubé, Fatma Haddad
Optimal Single- and Multiple-Tree Almost Instantaneous Variable-to-Fixed Codes. DCC (2018)
Manuel Martínez, Kai Sandfort, Danny Dubé, Joan Serra-Sagristà
Improving Marlin's Compression Ratio with Partially Overlapping Codewords. DCC (2018)
Danny Dubé, Fatma Haddad
Individually Optimal Single- and Multiple-Tree Almost Instantaneous Variable-to-Fixed Codes. ISIT (2018)
Danny Dubé
Arbitrarily Low Redundancy Construction of Balanced Codes Using Realistic Resources. ISITA (2018)
Danny Dubé, Mounir Mechqrane
Almost minimum-redundancy construction of balanced codes using limited-precision integers. CWIT (2017)
Dany Vohl, Claude-Guy Quimper, Danny Dubé
Finding Synchronization Codes to Boost Compression by Substring Enumeration. CoRR (2016)
Ahmad Al-Rababa'a, Danny Dubé
A finite-precision adaptation of bit recycling to arithmetic coding. ISSPIT (2015)
Ahmad Al-Rababa'a, Danny Dubé
Using bit recycling to reduce the redundancy in plurally parsable dictionaries. CWIT (2015)
Mathieu Beliveau, Danny Dubé
Improving Compression via Substring Enumeration by Explicit Phase Awareness. DCC (2014)
Martin Beaudry, Danny Dubé, Maxime Dubé, Mario Latendresse, Pascal Tesson
Conservative groupoids recognize only regular languages. Inf. Comput. 239 (2014)
Ahmad Al-Rababa'a, Danny Dubé, Jean-Yves Chouinard
Using bit recycling to reduce Knuth's balanced codes redundancy. CWIT (2013)
Danny Dubé, Mario Latendresse, Pascal Tesson
Conservative Groupoids Recognize Only Regular Languages. LATA (2012)
Danny Dubé
On the Use of Stronger Synchronization to Boost Compression by Substring Enumeration. DCC (2011)
Danny Dubé, Hidetoshi Yokoo
The universality and linearity of compression by substring enumeration. ISIT (2011)
Heidar Pirzadeh, Danny Dubé, Abdelwahab Hamou-Lhadj
An Extended Proof-Carrying Code Framework for Security Enforcement. Trans. Comput. Sci. 11 (2010)
Danny Dubé, Vincent Beaudoin
Lossless Data Compression via Substring Enumeration. DCC (2010)
Danny Dubé
Using synchronization bits to boost compression by substring enumeration. ISITA (2010)
Danny Dubé, Vincent Beaudoin
Constructing optimal whole-bit recycling codes. ITW (2009)
Danny Dubé, Vincent Beaudoin
All-Match LZ77 Bit Recycling. DCC (2008)
Heidar Pirzadeh, Danny Dubé
VEP: a virtual machine for extended proof-carrying code. VMSec (2008)
Heidar Pirzadeh, Danny Dubé
Encoding the Program Correctness Proofs as Programs in PCC Technology. PST (2008)
Danny Dubé, Vincent Beaudoin
Improving LZ77 bit recycling using all matches. ISIT (2008)
Danny Dubé, Vincent Beaudoin
Bit Recycling with Prefix Codes. DCC (2007)
Danny Dubé, Marc Feeley
BIT: A Very Compact Scheme System for Microcontrollers. High. Order Symb. Comput. 18 (3-4) (2005)
Danny Dubé, Marc Feeley
A demand-driven adaptive type analysis. ICFP (2002)
Danny Dubé, Marc Feeley
Efficiently building a parse tree from a regular expression. Acta Informatica 37 (2) (2000)
Jean-Yves Potvin, Danny Dubé, Christian Robillard
A Hybrid Approach to Vehicle Routing Using Neural Networks and Genetic Algorithms. Appl. Intell. 6 (3) (1996)
Jean-Yves Potvin, Danny Dubé
Improving a Vehicle Routing Heuristic Through Genetic Search. International Conference on Evolutionary Computation (1994)