Sciweavers

709 search results - page 22 / 142
» In-stroke word completion
Sort
View
JUCS
2002
93views more  JUCS 2002»
14 years 11 months ago
On the Semiautomatic Generation of WordNet Type Synsets and Clusters
: WordNet (WN) is a lexical knowledge base, first developed for English and then adopted for several Western European languages, which was created as a machinereadable dictionary b...
Florentina Hristea
DATE
1998
IEEE
106views Hardware» more  DATE 1998»
15 years 4 months ago
March Tests for Word-Oriented Memories
Most memory test algorithms are optimized tests for a particular memory technology and a particular set of fault models, under the assumption that the memory is bit-oriented; i.e....
A. J. van de Goor, Issam B. S. Tlili
FMCAD
2008
Springer
15 years 1 months ago
Word-Level Sequential Memory Abstraction for Model Checking
el Sequential Memory Abstraction for Model Checking Per Bjesse Advanced Technology Group Synopsys Inc. Many designs intermingle large memories with wide data paths and nontrivial c...
Per Bjesse
ENTCS
2007
104views more  ENTCS 2007»
14 years 11 months ago
An Algebra of Pure Quantum Programming
We develop a sound and complete equational theory for the functional quantum programming language QML. The soundness and completeness of the theory are with respect to the previou...
Thorsten Altenkirch, Jonathan Grattage, Juliana Ka...
RTA
2010
Springer
15 years 3 months ago
Automata for Data Words and Data Trees
Data words and data trees appear in verification and XML processing. The term “data” means that positions of the word, or tree, are decorated with elements of an infinite set...
Mikolaj Bojanczyk