1640 search results - page 63 / 328 » Conditional Independence Trees |
124
Voted
LICS
2009
IEEE
15 years 9 months ago
2009
IEEE
—We use the recently developed theory of forest algebras to find algebraic characterizations of the languages of unranked trees and forests definable in various logics. These i...
126
Voted
EPEW
2008
Springer
15 years 4 months ago
2008
Springer
The accessible specification of performance queries is a key challenge in performance analysis. To this end, we seek to combine the intuitive aspects of natural language query spec...
119
Voted
SODA
2003
ACM
15 years 3 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...
109
Voted
ACL
2007
15 years 4 months ago
2007
Previous studies in data-driven dependency parsing have shown that tree transformations can improve parsing accuracy for specific parsers and data sets. We investigate to what ex...
105
Voted
ICML
2003
IEEE
16 years 3 months ago
2003
IEEE
Bayesian classifiers such as Naive Bayes or Tree Augmented Naive Bayes (TAN) have shown excellent performance given their simplicity and heavy underlying independence assumptions....