Danny Dubé

According to our database, Danny Dubé authored at least 31 papers between 1994 and 2020.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2020

Entropy Coders Based on the Splitting of Lexicographic Intervals.

Danny Dubé

Proceedings of the Data Compression Conference, 2020

2019

Fast Construction of Almost Optimal Symbol Distributions for Asymmetric Numeral Systems.

Danny Dubé, Hidetoshi Yokoo

Proceedings of the IEEE International Symposium on Information Theory, 2019

Lossless Compression of Grayscale and Colour Images Using Multidimensional CSE.

Danny Dubé

Proceedings of the 11th International Symposium on Image and Signal Processing and Analysis, 2019

2018

Arbitrarily Low Redundancy Construction of Balanced Codes Using Realistic Resources.

Danny Dubé

Proceedings of the International Symposium on Information Theory and Its Applications, 2018

Individually Optimal Single- and Multiple-Tree Almost Instantaneous Variable-to-Fixed Codes.

Danny Dubé, Fatma Haddad

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Improving Marlin's Compression Ratio with Partially Overlapping Codewords.

Manuel Martínez, Kai Sandfort, Danny Dubé, Joan Serra-Sagristà

Proceedings of the 2018 Data Compression Conference, 2018

Optimal Single- and Multiple-Tree Almost Instantaneous Variable-to-Fixed Codes.

Danny Dubé, Fatma Haddad

Proceedings of the 2018 Data Compression Conference, 2018

2017

Almost minimum-redundancy construction of balanced codes using limited-precision integers.

Danny Dubé, Mounir Mechqrane

Proceedings of the 15th Canadian Workshop on Information Theory, 2017

2016

Finding Synchronization Codes to Boost Compression by Substring Enumeration.

Dany Vohl, Claude-Guy Quimper, Danny Dubé

CoRR, 2016

2015

A finite-precision adaptation of bit recycling to arithmetic coding.

Ahmad Al-Rababa'a, Danny Dubé

Proceedings of the IEEE International Symposium on Signal Processing and Information Technology, 2015

Using bit recycling to reduce the redundancy in plurally parsable dictionaries.

Ahmad Al-Rababa'a, Danny Dubé

Proceedings of the 14th IEEE Canadian Workshop on Information Theory, 2015

2014

Conservative groupoids recognize only regular languages.

Martin Beaudry, Danny Dubé, Maxime Dubé, Mario Latendresse, Pascal Tesson

Inf. Comput., 2014

Improving Compression via Substring Enumeration by Explicit Phase Awareness.

Mathieu Beliveau, Danny Dubé

Proceedings of the Data Compression Conference, 2014

2013

Using bit recycling to reduce Knuth's balanced codes redundancy.

Ahmad Al-Rababa'a, Danny Dubé, Jean-Yves Chouinard

Proceedings of the 13th Canadian Workshop on Information Theory, 2013

2012

Conservative Groupoids Recognize Only Regular Languages.

Danny Dubé, Mario Latendresse, Pascal Tesson

Proceedings of the Language and Automata Theory and Applications, 2012

2011

The universality and linearity of compression by substring enumeration.

Danny Dubé, Hidetoshi Yokoo

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

On the Use of Stronger Synchronization to Boost Compression by Substring Enumeration.

Danny Dubé

Proceedings of the 2011 Data Compression Conference (DCC 2011), 2011

2010

An Extended Proof-Carrying Code Framework for Security Enforcement.

Heidar Pirzadeh, Danny Dubé, Abdelwahab Hamou-Lhadj

Trans. Comput. Sci., 2010

Using synchronization bits to boost compression by substring enumeration.

Danny Dubé

Proceedings of the International Symposium on Information Theory and its Applications, 2010

Lossless Data Compression via Substring Enumeration.

Danny Dubé, Vincent Beaudoin

Proceedings of the 2010 Data Compression Conference (DCC 2010), 2010

2009

Constructing optimal whole-bit recycling codes.

Danny Dubé, Vincent Beaudoin

Proceedings of the 2009 IEEE Information Theory Workshop, 2009

2008

Encoding the Program Correctness Proofs as Programs in PCC Technology.

Heidar Pirzadeh, Danny Dubé

Proceedings of the Sixth Annual Conference on Privacy, Security and Trust, 2008

Improving LZ77 bit recycling using all matches.

Danny Dubé, Vincent Beaudoin

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

All-Match LZ77 Bit Recycling.

Danny Dubé, Vincent Beaudoin

Proceedings of the 2008 Data Compression Conference (DCC 2008), 2008

VEP: a virtual machine for extended proof-carrying code.

Heidar Pirzadeh, Danny Dubé

Proceedings of the 1st ACM Workshop on Virtual Machine Security, 2008

2007

Bit Recycling with Prefix Codes.

Danny Dubé, Vincent Beaudoin

Proceedings of the 2007 Data Compression Conference (DCC 2007), 2007

2005

BIT: A Very Compact Scheme System for Microcontrollers.

Danny Dubé, Marc Feeley

High. Order Symb. Comput., 2005

2002

A demand-driven adaptive type analysis.

Danny Dubé, Marc Feeley

Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming (ICFP '02), 2002

2000

Efficiently building a parse tree from a regular expression.

Danny Dubé, Marc Feeley

Acta Informatica, 2000

1996

A Hybrid Approach to Vehicle Routing Using Neural Networks and Genetic Algorithms.

Jean-Yves Potvin, Danny Dubé, Christian Robillard

Appl. Intell., 1996

1994

Improving a Vehicle Routing Heuristic Through Genetic Search.

Jean-Yves Potvin, Danny Dubé

Proceedings of the First IEEE Conference on Evolutionary Computation, 1994