170 search results - page 12 / 34 » Algorithms on Compressed Strings and Arrays |
SIGIR
1998
ACM
15 years 1 months ago
1998
ACM
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
ICASSP
2008
IEEE
15 years 4 months ago
2008
IEEE
Joint processing of sensor array outputs improves the performance of parameter estimation and hypothesis testing problems beyond the sum of the individual sensor processing result...
JEA
2008
14 years 9 months ago
2008
Suffix arrays are a simple and powerful data structure for text processing that can be used for full text indexes, data compression, and many other applications in particular in b...
JACM
2006
14 years 9 months ago
2006
Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences. Practitioners prefer suffix arrays due to their simplicity an...
172
click to vote
FCCM
2011
IEEE
14 years 1 months ago
2011
IEEE
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...