This paper proposes the use of a crossbar-like tree structure to use with Dynamic Markov Compression (DMC) for the compression of Chinese text files. DMC had previously been found...
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dyna...
After installing an OS distribution, a computer is generally not yet properly adapted to go into production at the local site. Security policies must be implemented, local service...
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
The data sets for many of today's computer applications are too large to t within the computer's internal memory and must instead be stored on external storage devices su...