494 search results - page 69 / 99 » Heap Building Bounds |
STOC
1998
ACM
15 years 3 months ago
1998
ACM
In [6], Gallager introduces a family of codes based on sparse bipartite graphs, which he calls low-density parity-check codes. He suggests a natural decoding algorithm for these c...
CIKM
2009
Springer
15 years 2 months ago
2009
Springer
Traditional routing indices in peer-to-peer (P2P) networks are mainly designed for document retrieval applications and maintain aggregated one-dimensional values representing the ...
CICLING
2006
Springer
15 years 2 months ago
2006
Springer
The automatic generation of back-of-the book indexes seems to be out of sight of the Information Retrieval and Natural Language Processing communities, although the increasingly la...
ESORICS
2006
Springer
15 years 2 months ago
2006
Springer
IDS research still needs to strengthen mathematical foundations and theoretic guidelines. In this paper, we build a formal framework, based on information theory, for analyzing and...
LATIN
2010
Springer
15 years 23 days ago
2010
Springer
In this paper we describe algorithms for computing the BWT and for building (compressed) indexes in external memory. The innovative feature of our algorithms is that they are light...