65 search results - page 11 / 13 » Some Results on Top-Context-Free Tree Languages |
CICLING
2010
Springer
13 years 10 months ago
2010
Springer
"Short-text clustering" is a very important research field due to the current tendency for people to use very short documents, e.g. blogs, text-messaging and others. In s...
POPL
2008
ACM
14 years 7 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
CP
2005
Springer
14 years 27 days ago
2005
Springer
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...
LREC
2010
13 years 8 months ago
2010
This paper investigates the mapping between two semantic formalisms, namely the tectogrammatical layer of the Prague Dependency Treebank 2.0 (PDT) and (Robust) Minimal Recursion S...
CSMR
2000
IEEE
13 years 11 months ago
2000
IEEE
The assessment of the changeability of software systems is of major concern for buyers of the large systems found in fast-moving domains such as telecommunications. One way of app...