182 search results - page 1 / 37 » Compact Balanced Tries |
IFIP
1992
Springer
13 years 11 months ago
1992
Springer
EUROPAR
2003
Springer
14 years 19 days ago
2003
Springer
In this paper we propose a new parallel clustering algorithm based on the incremental construction of the compact sets of a collection of objects. This parallel algorithm is portab...
ALENEX
2003
13 years 8 months ago
2003
Ongoing changes in computer performance are affecting the efficiency of string sorting algorithms. The size of main memory in typical computers continues to grow, but memory acce...
IACR
2011
12 years 7 months ago
2011
The McEliece cryptosystem is one of the few systems to be considered secure against attacks by Quantum computers. The original scheme is built upon Goppa codes and produces very l...
CPM
2004
Springer
14 years 25 days ago
2004
Springer
We describe a new technique for reducing the number of nodes and symbols in automata based on tries. The technique stems from some results on anti-dictionaries for data compression...