709 search results - page 34 / 142 » In-stroke word completion |
ICCD
2001
IEEE
15 years 8 months ago
2001
IEEE
We propose two new instructions, swperm and sieve, that can be used to efficiently complete an arbitrary bit-level permutation of an n-bit word with or without repetitions. Permut...
137
click to vote
ITNG
2006
IEEE
15 years 5 months ago
2006
IEEE
We propose a new method, called closed multidimensional sequential pattern mining, for mining multidimensional sequential patterns. The new method is an integration of closed sequ...
COCO
2003
Springer
15 years 5 months ago
2003
Springer
We study the question of whether the class DisjNP of disjoint pairs (A, B) of NP-sets contains a complete pair. The question relates to the question of whether optimal proof system...
CVPR
2003
IEEE
16 years 1 months ago
2003
IEEE
In this paper we explore object recognition in clutter. We test our object recognition techniques on Gimpy and EZGimpy, examples of visual CAPTCHAs. A CAPTCHA ("Completely Au...
AIIA
2005
Springer
15 years 5 months ago
2005
Springer
We designed and implemented a software system, called WebCrow, that represents the first solver for Italian crosswords and the first system that tackles a language game using the...