250 search results - page 40 / 50 » Reorganizing compressed text |
CPM
2005
Springer
14 years 28 days ago
2005
Springer
A succinct full-text self-index is a data structure built on a text T = t1t2 . . . tn, which takes little space (ideally close to that of the compressed text), permits efficient se...
FPL
2009
Springer
13 years 11 months ago
2009
Springer
This paper presents a virus scanning engine. After showing the difference between ClamAV (an anti-virus software) and SNORT (an intrusion detection software), we show a new archit...
FLAIRS
2008
13 years 9 months ago
2008
As a side effect of e-marketing strategy the number of spam e-mails is rocketing, the time and cost needed to deal with spam as well. Spam filtering is one of the most difficult t...
JEA
2008
13 years 7 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...
ICDAR
2003
IEEE
14 years 21 days ago
2003
IEEE
Our aim is to achieve writer identification process thanks to a fractal analysis of handwriting style. For each writer, a set of characteristics is extracted. They are specific to...