231 search results - page 3 / 47 » Context Matching for Compressed Terms |
91
Voted
CPM
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. We apply the Boyer–Moore technique to compressed pattern matching for text string described in terms of collage system, which is a formal framework that captures variou...
SPIRE
2000
Springer
15 years 1 months ago
2000
Springer
We consider a fully compressed pattern matching problem, where both text T and pattern P are given by its succinct representation, in terms of straight-line programs and its varia...
93
Voted
CONTEXT
1999
Springer
15 years 1 months ago
1999
Springer
This paper presents a practical application of context for the evaluation of semantic similarity. The work is based on a new model for the assessment of semantic similarity among ...
ECMAST
1999
Springer
15 years 1 months ago
1999
Springer
This paper presents the constraints involved by MPEG-4 to copyright protection systems based upon watermarking technology. It proposes also an assessment methodology in order to ev...
101
click to vote
DCC
1992
IEEE
15 years 1 months ago
1992
IEEE
Text compression algorithms are normally defined in terms of a source alphabet of 8-bit ASCII codes. We consider choosing to be an alphabet whose symbols are the words of Englis...