65 search results - page 12 / 13 » Some Results on Top-Context-Free Tree Languages |
COMPSAC
2000
IEEE
13 years 11 months ago
2000
IEEE
Genetic programming tackles the issue of how to automatically create a working computer program for a given problem from some initial problem statement. The goal is accomplished i...
SPEECH
2010
13 years 2 months ago
2010
One of the main problems in developing a text-to-speech (TTS) synthesizer for French lies in grapheme-to-phoneme conversion. Automatic converters produce still too many errors in ...
LCTRTS
2010
Springer
14 years 2 months ago
2010
Springer
A large number of embedded systems include 8-bit microcontrollers for their energy efficiency and low cost. Multi-bank memory architecture is commonly applied in 8-bit microcontr...
ICALP
2003
Springer
14 years 16 days ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Local (first order) sentences, introduced by Ressayre, enjoy very nice decidability properties, following from some stretching theorems stating some remarkable links between the ...