Articles dans des revues avec comité de lecture (114)
107.
Cardinal, J. (2003). Multistage Index Assignments for $M$-Description Coding. Proceedings - International Conference on Image Processing, 3, 249-252.
108.
Cardinal, J. (2003). Compression of side Information. Proceedings (IEEE International Conference on Multimedia and Expo), 2, 569-572. doi:10.1109/ICME.2003.1221680
109.
Cardinal, J. (2002). Complexity-constrained tree-structured vector quantizers. Signal processing, 82(8), 1176-1182. doi:10.1016/S0165-1684(02)00253-0
110.
Cardinal, J., & Van Assche, G. (2002). Joint Entropy-Constrained Multiterminal Quantization. Proceedings (IEEE International Symposium on Information Theory. Print), 63.
111.
Cardinal, J. (2001). Design of tree-structured multiple description vector quantizers. Data Compression Conference Proceedings, 23-32.
112.
Cardinal, J. (2001). Fast fractal compression of greyscale images. IEEE transactions on image processing, 10(1), 159-164. doi:10.1109/83.892452
113.
Cardinal, J. (2000). A Lagrangian optimization approach to complexity-constrained TSVQ. IEEE signal processing letters, 7(11), 304-306. doi:10.1109/97.873565
114.
Cardinal, J. (2000). Tree-based search for ECVQ. Data Compression Conference Proceedings, 548.
Articles dans des revues sans comité de lecture (8)
1.
Cardinal, J., Dallant, J., & Iacono, J. (2021). An Instance-optimal Algorithm for Bichromatic Rectangular Visibility. arXiv.org.
2.
Cardinal, J., Dallant, J., & Iacono, J. (2021). Approximability of (Simultaneous) Class Cover for Boxes. arXiv.org, abs/2106.12969.
3.
Bhore, S. K., Cardinal, J., Iacono, J., & Koumoutsos, G. (2020). Dynamic Geometric Independent Set. arXiv.org.
4.
Cardinal, J., & Iacono, J. (2020). Modular Subset Sum, Dynamic Strings, and Zero-Sum Sets. arXiv.org.