Sciweavers

1215 search results - page 167 / 243
» Combinatorics
Sort
View
JCDL
2003
ACM
111views Education» more  JCDL 2003»
15 years 3 months ago
Correcting Broken Characters in the Recognition of Historical Printed Documents
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...
Michael Droettboom
COCOON
2003
Springer
15 years 3 months ago
The Complexity of Boolean Matrix Root Computation
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...
Martin Kutz
CSR
2008
Springer
14 years 11 months ago
Invariant Generation for P-Solvable Loops with Assignments
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...
Laura Kovács
PPSC
1997
14 years 11 months ago
A Parallel Algorithm for Interval Polynomial Interpolation
By taking data measurement errors into considerations, numerical results obtained by interval polynomial interpolation [5] are highly reliable. To reduce overestimation, combinati...
Chenyi Hu
ACL
1990
14 years 11 months ago
Free Indexation: Combinatorial Analysis and a Compositional Algorithm
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...
Sandiway Fong