3818 search results - page 285 / 764 » Word Problems on Compressed Words |
172
Voted
INFFUS
2006
15 years 6 months ago
2006
Automatic pronunciation of words from their spelling alone is a hard computational problem, especially for languages like English and French where there is only a partially consis...
191
click to vote
JUCS
2006
15 years 6 months ago
2006
Abstract: Combinatorial property testing, initiated formally by Goldreich, Goldwasser, and Ron in [Goldreich et al. (1998)] and inspired by Rubinfeld and Sudan in [Rubinfeld and Su...
187
Voted
JUCS
2002
15 years 6 months ago
2002
: Let G = (V, E) be a strongly connected and aperiodic directed graph of uniform out-degree k. A deterministic finite automaton is obtained if the edges are colored with k colors i...
175
click to vote
PRL
2002
15 years 6 months ago
2002
It has always been difficult for language understanding systems to handle spontaneous speech with satisfactory robustness, primarily due to such problems as the fragments, disflue...
176
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
Service robots will have to accomplish more and more complex, open-ended tasks and regularly acquire new skills. In this work, we propose a new approach to generating plans for su...