Sciweavers

2018 search results - page 97 / 404
» Code Normal Forms
Sort
View
ICPR
2006
IEEE
16 years 5 months ago
Hybrid Off-Line Cursive Handwriting Word Recognition
In this paper, we present an off-line cursive word handwriting recognition methodology. This is based on an additive fusion resulted after a novel combination of two different mod...
Basilios Gatos, Ioannis Pratikakis, Stavros J. Per...
TLCA
2009
Springer
15 years 10 months ago
On the Values of Reducibility Candidates
The straightforward elimination of union types is known to break subject reduction, and for some extensions of the lambda-calculus, to break strong normalization as well. Similarly...
Colin Riba
DEXAW
2007
IEEE
105views Database» more  DEXAW 2007»
15 years 10 months ago
Classifying XML Documents by Using Genre Features
The categorization of documents is traditionally topic-based. This paper presents a complementary analysis of research and experiments on genre to show that encouraging results ca...
Malcolm Clark, Stuart N. K. Watt
BIRTHDAY
2007
Springer
15 years 10 months ago
Reduction Strategies and Acyclicity
Abstract. In this paper we review some well-known theory about reduction strategies of various kinds: normalizing, outermost-fair, cofinal, Church-Rosser. A stumbling block in the...
Jan Willem Klop, Vincent van Oostrom, Femke van Ra...
CSL
2007
Springer
15 years 10 months ago
Focusing and Polarization in Intuitionistic Logic
A focused proof system provides a normal form to cut-free proofs that structures the application of invertible and non-invertible inference rules. The focused proof system of Andre...
Chuck Liang, Dale Miller