1862 search results - page 10 / 373 » Constrained pattern matching |
DMTCS
2007
13 years 8 months ago
2007
A binary sequence of zeros and ones is called a (d, k)-sequence if it does not contain runs of zeros of length either less than d or greater than k, where d and k are arbitrary, b...
ICPR
2000
IEEE
14 years 1 days ago
2000
IEEE
In some classification tasks, all patterns in a field, such as digits in a ZIP-code image, originate from the same, but unknown, source (writer/print style). The class-conditional...
FLAIRS
2007
13 years 10 months ago
2007
In this paper we present a novel approach for patternconstrained test case generation. The generation of test cases with known characteristics is usually a non-trivial task. In co...
PAMI
2007
13 years 8 months ago
2007
—We formalize the notion of style context, which accounts for the increased accuracy of the field classifiers reported in this journal recently. We argue that style context forms...
TCOM
2010
13 years 6 months ago
2010
—We propose weakly-constrained stream and block codes with tunable pattern-dependent statistics and demonstrate that the block code capacity at large block sizes is close to the ...