Abstract. We prove that the homomorphic quasiorder of finite k-labeled forests has undecidable elementary theory for k 3, in contrast to the known decidability result for k = 2. W...
We describe a method for implementing the evaluation and training of decision trees and forests entirely on a GPU, and show how this method can be used in the context of object rec...
Streaming validation and querying of XML documents are often based on automata for tree-like structures. We propose a new notion of streaming tree automata in order to unify the t...
In this paper, we explore the use of Random Forests (RFs) in the structured language model (SLM), which uses rich syntactic information in predicting the next word based on words ...
One of the great challenges today is to index videos with high-level semantic concepts or features. The basis of our approach is to use a fuzzy decision trees (FDT) to construct t...