709 search results - page 5 / 142 » In-stroke word completion |
COMBINATORICS
2000
13 years 10 months ago
2000
A construction is described for combining affine designs with complete sets of mutually orthogonal frequency squares to produce other complete sets. Key words: Matrices, orthogona...
ANLP
2000
14 years 6 days ago
2000
This work is in the context of TransType, a system that observes its user as he or she types a translation and repeatedly suggests completions for the text already entered. The us...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
In this paper we prove that for any infinite word w whose set of factors is closed under reversal, the following conditions are equivalent: (I) all complete returns to palindromes...
CSB
2004
IEEE
14 years 2 months ago
2004
IEEE
Shannon information in the genomes of all completely sequenced prokaryotes and eukaryotes are measured in word lengths of two to ten letters. It is found that in a scale-dependent...
APAL
2007
13 years 11 months ago
2007
In this paper we consider a type system with a universal type ω where any term (whether open or closed, β-normalising or not) has type ω. We provide this type system with a rea...