Sciweavers

2475 search results - page 131 / 495
» On the accuracy of language trees
Sort
View
CONCUR
2006
Springer
15 years 8 months ago
Inference of Event-Recording Automata Using Timed Decision Trees
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
Olga Grinchtein, Bengt Jonsson, Paul Pettersson
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...
ASPLOS
2012
ACM
14 years 2 months ago
Scalable address spaces using RCU balanced trees
Software developers commonly exploit multicore processors by building multithreaded software in which all threads of an application share a single address space. This shared addre...
Austin T. Clements, M. Frans Kaashoek, Nickolai Ze...
VL
2003
IEEE
146views Visual Languages» more  VL 2003»
15 years 11 months ago
A reading algorithm for constraint diagrams
Constraint diagrams are a visual notation designed to complement the Unified Modeling Language in the development of software systems. They generalize Venn diagrams and Euler cir...
Andrew Fish, Jean Flower, John Howse
ANLP
2000
126views more  ANLP 2000»
15 years 7 months ago
The Automatic Translation of Discourse Structures
We empirically show that there are significant differences between the discourse structure of Japanese texts and the discourse structure of their corresponding English translation...
Daniel Marcu, Lynn Carlson, Maki Watanabe