Amar Mukherjee

TL;DR: This book will serve as a reference for seasoned professionals or researchers in the area, while providing a gentle introduction, making it accessible for senior undergraduate students or first year graduate students embarking upon research in compression, pattern matching, full text retrieval, compressed index structures, or other areas related to the BWT.

TL;DR: A class of VLSI architectures for data transformation of tree-based codes is proposed, concentrating on transformation functions used for data compression and decompression, and the design approaches are applicable to any binary codes.

TL;DR: This paper presents an efficient sub-linear algorithm to render dynamic glossy objects under time-variant all-frequency lighting and arbitrary view conditions in a few seconds on a commodity CPU, orders of magnitude faster than previous techniques.

TL;DR: Off-line dictionary oriented approaches to DNA sequence compression, based on the Burrows-Wheeler Transform, are investigated, which proposes off-line methods to compress DNA sequences that exploit the different repetition structures inherent in such sequences.

TL;DR: In this paper, a code converter has a network of logic circuits connected in reverse binary tree fashion with logic paths between leaf nodes and a common root node, and characters are compressed from standard codes to variable-length Huffman code by pulse applying connections to the paths from a decoder.