Sciweavers

773 search results - page 58 / 155
» Suffix Trees on Words
Sort
View
INTERSPEECH
2010
15 years 1 months ago
Modeling liaison in French by using decision trees
French is known to be a language with major pronunciation irregularities at word endings with consonants. Particularly, the well-known phonetic phenomenon called Liaison is one of...
Josafá de Jesus Aguiar Pontes, Sadaoki Furu...
ICWL
2005
Springer
15 years 11 months ago
Automatic Leveling System for E-Learning Examination Pool Using Entropy-Based Decision Tree
In this paper, we propose an automatic leveling system for e-learning examination pool using the algorithm of the decision tree. The automatic leveling system is built to automatic...
Shu-Chen Cheng, Yueh-Min Huang, Juei-Nan Chen, Yen...
DAM
2008
78views more  DAM 2008»
15 years 6 months ago
Semi-preemptive routing on trees
We study a variant of the pickup-and-delivery problem (PDP) in which the objects that have to be transported can be reloaded at most d times, for a given d N. This problem is kno...
Sven Oliver Krumke, Dirk Räbiger, Rainer Schr...
DAM
2002
67views more  DAM 2002»
15 years 6 months ago
Optimal arrangement of data in a tree directory
We define the decision problem data arrangement, which involves arranging the vertices of a graph G at the leaves of a d-ary tree so that a weighted sum of the distances between p...
Malwina J. Luczak, Steven D. Noble
JACM
2000
119views more  JACM 2000»
15 years 6 months ago
A minimum spanning tree algorithm with Inverse-Ackermann type complexity
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
Bernard Chazelle