3818 search results - page 71 / 764 » Word Problems on Compressed Words |
132
click to vote
FOCM
2011
14 years 11 months ago
2011
The matrix rank minimization problem has applications in many fields such as system identification, optimal control, low-dimensional embedding etc. As this problem is NP-hard in ...
144
click to vote
ANLP
2000
15 years 5 months ago
2000
This paper describes an approach to providing lexical information for natural language processing in unrestricted domains. A system of approximately 1200 morphological rules is us...
108
click to vote
CORR
1998
Springer
15 years 4 months ago
1998
Springer
This paper presents trainable methods for generating letter to sound rules from a given lexicon for use in pronouncing out-ofvocabulary words and as a method for lexicon compressi...
111
click to vote
CPM
2004
Springer
15 years 9 months ago
2004
Springer
We describe a new technique for reducing the number of nodes and symbols in automata based on tries. The technique stems from some results on anti-dictionaries for data compression...
160
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
The value 1 problem is a decision problem for probabilistic automata on finite words: given a probabilistic automaton A, are there words accepted by A with probability arbitraril...