2475 search results - page 8 / 495 » On the accuracy of language trees |
DATESO
2009
13 years 5 months ago
2009
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....
CSE
2009
IEEE
14 years 2 months ago
2009
IEEE
—Mobile devices can produce continuous streams of data which are often specific to the person carrying them. We show that cell phone tracks from the MIT Reality dataset can be u...
CIDM
2007
IEEE
13 years 11 months ago
2007
IEEE
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
TSD
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The prosodic specification of an utterance to be spoken by a Textto-Speech synthesis system can be devised in break indices, pitch accents and boundary tones. In particu...
DLT
2008
13 years 9 months ago
2008
Abstract. Since recognizable tree languages are closed under the rational operations, every regular tree expression denotes a recognizable tree language. We provide an alternative ...