926 search results - page 165 / 186 » Improving HTML Compression |
85
Voted
EXPCS
2007
15 years 1 months ago
2007
Utility programs, which perform similar and largely independent operations on a sequence of inputs, include such common applications as compilers, interpreters, and document parse...
101
click to vote
ICALP
2007
Springer
15 years 1 months ago
2007
Springer
Given string T = T[1, . . . , n], the suffix sorting problem is to lexicographically sort the suffixes T[i, . . . , n] for all i. This problem is central to the construction of suf...
93
Voted
CRV
2006
IEEE
15 years 1 months ago
2006
IEEE
Computational models of visual attention result in considerable data compression by eliminating processing on regions likely to be devoid of meaningful content. While saliency map...
ICMCS
1995
IEEE
15 years 1 months ago
1995
IEEE
– One approach to supporting continuous media traffic is via resource reservation at connection establishment time. The shortcomings of this approach are the lack of flexibility...
EDBT
2010
ACM
15 years 1 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...