1028 search results - page 33 / 206 » Character sets of strings |
ICDAR
2003
IEEE
14 years 27 days ago
2003
IEEE
In this paper, we propose a generalized shock model for the enhancement and restoration of degraded gray-level character images. This model is a quasi-linear hyperbolic partial di...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We are given a collection of m random subsequences (traces) of a string t of length n where each trace is obtained by deleting each bit in the string with probability q. Our goal ...
CPM
2007
Springer
14 years 1 months ago
2007
Springer
In the k-matches problem, we are given a pattern and a text, and for each text location, the desired output consists of all aligned matching characters if there are k or fewer of ...
CEC
2005
IEEE
14 years 1 months ago
2005
IEEE
An L-system or Lindenmayer system consists of a grammar and an interpreter. The grammar contains an axiom, usually a short string, that the grammar expands into a long, complex st...
ICDAR
2009
IEEE
13 years 5 months ago
2009
IEEE
Despite ubiquitous claims that optical character recognition (OCR) is a "solved problem," many categories of documents continue to break modern OCR software such as docu...