250 search results - page 12 / 50 » Reorganizing compressed text |
CSR
2006
Springer
13 years 11 months ago
2006
Springer
Given two strings (a text t of length n and a pattern p) and a natural number w, window subsequence problems consist in deciding whether p occurs as a subsequence of t and/or findi...
ACL
2006
13 years 8 months ago
2006
Sentence compression is the task of producing a summary at the sentence level. This paper focuses on three aspects of this task which have not received detailed treatment in the l...
ICIP
2002
IEEE
14 years 9 months ago
2002
IEEE
We propose a new, very low complexity, single-pass, algorithm for compression of continuous tone compound documents, known as GRAFIT (GuaRAnteed FIT) that can guarantee a minimum ...
CPM
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. Compressed pattern matching is one of the most active topics in string matching. The goal is to find all occurrences of a pattern in a compressed text without decompress...
IR
2007
13 years 7 months ago
2007
Variants of Huffman codes where words are taken as the source symbols are currently the most attractive choices to compress natural language text databases. In particular, Tagged...