This paper proposes an efficient algorithm to compress the cubes in the progress of the parallel data cube generation. This low overhead compression mechanism provides block-by-block and record-by-record compression by using tuple difference coding techniques, thereby maximizing the compression ratio and minimizing the decompression penalty at run-time. The experimental results demonstrate that...

People make systematic errors when localizing a stimulus that is presented briefly near the time of a saccade. These errors have been interpreted as compression towards the position that is fixated after the saccade. Normally, fixating a position means that its image falls on the fovea. Macular degeneration (MD) damages the central retina, obliterating foveal vision. Many people with MD adopt a...

The dynamic trie is a fundamental data structure which finds applications in many areas. This paper proposes a compressed version of the dynamic trie data structure. Our data-structure is not only space efficient, it also allows pattern searching in o(|P |) time and leaf insertion/deletion in o(log n) time, where |P | is the length of the pattern and n is the size of the trie. To demonstrate th...

Compression is most important when space is in short supply, so compression algorithms are often implemented in limited memory. Most analyses ignore memory constraints as an implementation detail, however, creating a gap between theory and practice. In this paper we consider the effect of memory limitations on compression algorithms. In the first part we assume the memory available is fixed and...

This paper discusses new space compression techniques for built-in self-testing (BIST) of VLSI circuits based on the use of compact test sets to minimize the storage requirements for the circuit under test (CUT) while maintaining the fault coverage information. The techniques utilize the concepts of Hamming distance and sequence weights along with failure probabilities of errors in the selectio...