15 search results - page 3 / 3 » Pattern Matching in Huffman Encoded Texts |
STACS
2009
Springer
14 years 24 days ago
2009
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
COLING
1990
13 years 7 months ago
1990
We consider the problem of extracting specified types of information from natural language text. To properly analyze the text, we wish to apply semantic (selectional) constraints ...
ICIP
1999
IEEE
14 years 7 months ago
1999
IEEE
We present a new image compression technique called DjVu" that is speci cally geared towards the compression of scanned documents in color at high resolution. With DjVu, a ma...
SIGMOD
2009
ACM
14 years 6 months ago
2009
ACM
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...
IBPRIA
2009
Springer
13 years 10 months ago
2009
Springer
ent abstract presents OASIS, an Online Algorithm for Scalable Image Similarity learning that learns a bilinear similarity measure over sparse representations. OASIS is an online du...