1215 search results - page 167 / 243 » Combinatorics |
133
click to vote
JCDL
2003
ACM
15 years 11 months ago
2003
ACM
This paper presents a new technique for dealing with broken characters, one of the major challenges in the optical character recognition (OCR) of degraded historical printed docum...
146
click to vote
COCOON
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...
154
click to vote
CSR
2008
Springer
15 years 7 months ago
2008
Springer
We discuss interesting properties of a general technique for inferring polynomial invariants for a subfamily of imperative loops, called the P-solvable loops, with assignments only...
122
click to vote
PPSC
1997
15 years 7 months ago
1997
By taking data measurement errors into considerations, numerical results obtained by interval polynomial interpolation [5] are highly reliable. To reduce overestimation, combinati...
152
click to vote
ACL
1990
15 years 7 months ago
1990
The principle known as 'free indexation' plays an important role in the determination of the referential properties of noun phrases in the principleand-parameters langua...