115 search results - page 15 / 23 » Compressed text indexes: From theory to practice |
CLEIEJ
2008
13 years 7 months ago
2008
A lot of material has been written about wavelet theory. Most of these texts provide an elegant framework from the functional and real analysis point of view. The complete infinit...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Compressive sensing (CS) exploits the sparsity present in many common signals to reduce the number of measurements needed for digital acquisition. With this reduction would come, ...
BMCBI
2010
13 years 7 months ago
2010
Background: Text mining has become a useful tool for biologists trying to understand the genetics of diseases. In particular, it can help identify the most interesting candidate g...
EDBT
2010
ACM
13 years 10 months ago
2010
ACM
Suffix trees are indexing structures that enhance the performance of numerous string processing algorithms. In this paper, we propose cache-conscious suffix tree construction algo...
CAV
1999
Springer
13 years 11 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...