2463 search results - page 81 / 493 » Compressing Pattern Databases |
MFCS
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. Straight-line programs (SLPs) offer powerful text compression by representing a text T[1, u] in terms of a restricted context-free grammar of n rules, so that T can be r...
ICDAR
2003
IEEE
14 years 3 months ago
2003
IEEE
In this paper, we present a compressed pattern matching method for searching user queried words in the CCITT Group 4 compressed document images, without decompressing. The feature...
CPM
2000
Springer
14 years 2 months ago
2000
Springer
We present a Boyer-Moore approach to string matching over LZ78 and LZW compressed text. The key idea is that, despite that we cannot exactly choose which text characters to inspect...
COLING
2008
13 years 12 months ago
2008
A noun-compound is a compressed proposition that requires an audience to recover the implicit relationship between two concepts that are expressed as nouns. Listeners recover this...
ER
2007
Springer
14 years 2 months ago
2007
Springer
We propose a small set of parameterized abstract models for workflow patterns, starting from first principles for sequential and distributed control. Appropriate instantiations yie...