4066 search results - page 297 / 814 » Almost Complete Sets |
162
Voted
ICALP
2003
Springer
16 years 20 days ago
2003
Springer
We provide an answer to an open question, posed by van Glabbeek [4], regarding the axiomatizability of ready trace semantics. We prove that if the alphabet of actions is finite, t...
202
Voted
CICLING
2001
Springer
15 years 12 months ago
2001
Springer
In this paper we describe a rule-based formalism for the analysis and labelling of texts segments. The rules are contextual rewriting rules with a restricted form of negation. They...
189
Voted
FSTTCS
2001
Springer
15 years 12 months ago
2001
Springer
Given a binary relation IE ∪ IR on the set of ground terms e signature, we define an abstract rewrite closure for IE ∪ IR. act rewrite closure can be interpreted as a speciali...
204
Voted
ICPR
2000
IEEE
15 years 12 months ago
2000
IEEE
We consider simple digital curves in a 3D orthogonal grid as special polyhedrally bounded sets. These digital curves model digitized curves or arcs in three-dimensional euclidean ...
172
Voted
ICPR
2000
IEEE
15 years 12 months ago
2000
IEEE
In this paper, stochastic error-correcting parsing is proposed as a powerful and flexible method to post-process the results of an optical character recognizer (OCR). Determinist...