524 search results - page 22 / 105 » Context Trees |
NAACL
1994
13 years 8 months ago
1994
The key problem to be faced when building a HMM-based continuous speech recogniser is maintaining the balance between model complexity and available training data. For large vocab...
CL
2000
Springer
13 years 11 months ago
2000
Springer
This paper presents a method for representing trees using constraint logic programming over finite domains. We describe a class of trees that is of particular interest to us and h...
OOPSLA
2007
Springer
14 years 1 months ago
2007
Springer
Calling context enhances program understanding and dynamic analyses by providing a rich representation of program location. Compared to imperative programs, objectoriented program...
COMBINATORICS
2006
13 years 7 months ago
2006
This note deals with a formula due to G. Labelle for the summed cycle indices of all rooted trees, which resembles the well-known formula for the cycle index of the symmetric grou...
CHI
1994
ACM
13 years 11 months ago
1994
ACM
This paper introduces multitrees, a new type of structure for representing information. Multitrees are a class of directed acyclic graphs (DAGs) with the unusual property that the...