Danny Dubé

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