709 search results - page 10 / 142 » In-stroke word completion |
TSD
2000
Springer
15 years 3 months ago
2000
Springer
In this article, we present a test environment for a word analysis system that is used for reliable and sense-conveying hyphenation of German words. A crucial task is the hyphenati...
104
click to vote
TCS
2008
14 years 11 months ago
2008
Recently the second two authors characterized quasiperiodic Sturmian words, proving that a Sturmian word is non-quasiperiodic if and only if it is an infinite Lyndon word. Here we...
RTA
1991
Springer
15 years 3 months ago
1991
Springer
A term rewriting system is called complete if it is both confluent and strongly norrealizing. Barendregt and Klop showed that the disjoint union of complete term rewriting systems...
CG
2007
Springer
14 years 11 months ago
2007
Springer
This paper presents a novel gradient-based image completion algorithm for removing significant objects from natural images or photographs. Our method reconstructs the region of r...
GD
2004
Springer
15 years 5 months ago
2004
Springer
Consider the following question: does every complete geometric graph K2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directio...