Compressed data structure

Known as: Compressed data structures

The term compressed data structure arises in the computer science subfields of algorithms, data structures, and theoretical computer science. It…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

Karp et al. (1988) described Deferred Data Structures for Multisets as "lazy" data structures which partially sort data, so that…

2016

High-speed packet classification is crucial to the implementation of several advanced network services and protocols; many QoS…

2015

For meeting the requirements of the high-speed Internet and satisfying the Internet users, building fast routers with high-speed…

2015

Suffix trees are one of the most versatile data structures in stringology, with many applications in bioinformatics. Their main…

2013

The biggest cost of computing with large matrices in any modern computer is related to memory latency and bandwidth. The average…

2012

In this thesis we address the problem of the efficiency in Information Retrieval by presenting new compressed data structures and…

2006

We introduce two transformations T e x t 2 P o i n t s and P o i n t s 2 T e x t that, respectively, convert text to points in…

2006

Wireless networks have long ago surpassed their infancy, becoming eligible for sophisticated applications beyond common Web…

2005

1999

In this paper the authors present an algorithm which can be used for compressing text documents, principally. The algorithm…