169 search results - page 9 / 34 » Pattern Matching in Text Compressed by Using Antidictionarie... |
TVLSI
2010
13 years 2 months ago
2010
Abstract--Higher circuit densities in system-on-chip (SOC) designs have led to drastic increase in test data volume. Larger test data size demands not only higher memory requiremen...
JCSS
2010
13 years 5 months ago
2010
We present solutions for the k-mismatch pattern matching problem with don’t cares. Given a text t of length n and a pattern p of length m with don’t care symbols and a bound k...
NAACL
1994
13 years 8 months ago
1994
An ongoing debate in text understanding efforts centers on the use of pattern-matching techniques, which some have characterized as "designed to ignore as much text as possib...
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...
MFCS
2009
Springer
14 years 2 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...