Sciweavers

182 search results - page 1 / 37
» Compact Balanced Tries
Sort
View
IFIP
1992
Springer
14 years 2 months ago
Compact Balanced Tries
Pierre Nicodème
EUROPAR
2003
Springer
14 years 4 months ago
A Parallel Algorithm for Incremental Compact Clustering
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...
Reynaldo Gil-García, José Manuel Bad...
ALENEX
2003
144views Algorithms» more  ALENEX 2003»
14 years 7 days ago
Cache-Conscious Sorting of Large Sets of Strings with Dynamic Tries
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...
Ranjan Sinha, Justin Zobel
IACR
2011
133views more  IACR 2011»
12 years 10 months ago
Compact McEliece keys based on Quasi-Dyadic Srivastava codes
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...
Edoardo Persichetti
CPM
2004
Springer
87views Combinatorics» more  CPM 2004»
14 years 4 months ago
A Trie-Based Approach for Compacting Automata
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...
Maxime Crochemore, Chiara Epifanio, Roberto Grossi...