621 search results - page 59 / 125 » Parsing As Tree Traversal |
HPCA
2000
IEEE
14 years 2 months ago
2000
IEEE
Prefetching offers the potential to improve the performance of linked data structure (LDS) traversals. However, previously proposed prefetching methods only work well when there i...
ACL
1997
13 years 11 months ago
1997
In this paper we describe an approach to constraint based syntactic theories in terms of finite tree automata. The solutions to constraints expressed in weak monadic second order ...
NIPS
2001
13 years 11 months ago
2001
This paper presents a novel approach to the unsupervised learning of syntactic analyses of natural language text. Most previous work has focused on maximizing likelihood according...
SODA
2003
ACM
13 years 11 months ago
2003
ACM
We consider the costs of access to data stored in search trees assuming that those memory accesses are managed with a cache. Our cache memory model is two-level, has a small degre...
PAKDD
2001
ACM
14 years 2 months ago
2001
ACM
The alternating decision tree brings comprehensibility to the performance enhancing capabilities of boosting. A single interpretable tree is induced wherein knowledge is distribute...