621 search results - page 96 / 125 » Parsing As Tree Traversal |
CEC
2010
IEEE
13 years 11 months ago
2010
IEEE
Unsupervised grammar induction is one of the most difficult works of language processing. Its goal is to extract a grammar representing the language structure using texts without a...
SPIRE
2005
Springer
14 years 3 months ago
2005
Springer
Output-sensitive data structures result from preprocessing n items and are capable of reporting the items satisfying an on-line query in O(t(n) + ℓ) time, where t(n) is the cost ...
AOSD
2003
ACM
14 years 3 months ago
2003
ACM
We define a generic join point model for checking the Law of Demeter (LoD). Join points are trees, pointcuts are predicates over join points, and advice is checked statically sim...
DSN
2000
IEEE
14 years 2 months ago
2000
IEEE
An important technical hurdle blocking the adoption of mobile agent technology is the lack of reliability. Designing a reliable mobile agent system is especially challenging since...
DAWAK
2008
Springer
13 years 12 months ago
2008
Springer
The problem of discovering episode rules from static databases has been studied for years due to its wide applications in prediction. In this paper, we make the first attempt to st...