709 search results - page 26 / 142 » In-stroke word completion |
90
Voted
JUCS
2002
14 years 11 months ago
2002
Abstract: In this paper we introduce the concept of the quasi-product of tree automata. In a quasi-product the inputs of the component tree automata are operational symbols in whic...
125
click to vote
TIT
2008
14 years 11 months ago
2008
The term binary combinatorial Gray code refers to a list of binary words such that the Hamming distance between two neighboring words is one and the list satisfies some additional ...
117
click to vote
DCC
2011
IEEE
14 years 6 months ago
2011
IEEE
In this paper, we use linear approximations of the addition modulo 2n of three n-bit integers to identify linear approximations of g1, g2, the feedback functions of HC-128. This, i...
157
click to vote
VLDB
2007
ACM
16 years 1 days ago
2007
ACM
Autocompletion is a widely deployed facility in systems that require user input. Having the system complete a partially typed "word" can save user time and effort. In th...
102
click to vote
JOLLI
2002
14 years 11 months ago
2002
In this paper we suggest adding to predicate modal and temporal logic a locality predicate W which gives names to worlds (or time points). We also study an equal time predicate D(x...