180 search results - page 5 / 36 » Approximate Searching on Compressed Text |
TIP
2002
13 years 9 months ago
2002
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image sub-blocks by repeatedly searching a large virtual...
IR
2000
13 years 9 months ago
2000
Inverted index compression, block addressing and sequential search on compressed text are three techniques that have been separately developed for e cient, low-overhead text retrie...
IFIPTCS
2000
14 years 1 months ago
2000
We present an index to search a two-dimensional pattern of size m m in a two-dimensional text of size n n, even when the pattern appears rotated in the text. The index is based on ...
WIA
2007
Springer
14 years 3 months ago
2007
Springer
The Boyer and Moore (BM) pattern matching algorithm is considered as one of the best, but its performance is reduced on binary data. Yet, searching in binary texts has important a...
IPM
2007
13 years 9 months ago
2007
We describe a compression model for semistructured documents, called Structural Contexts Model (SCM), which takes advantage of the context information usually implicit in the stru...