321 search results - page 4 / 65 » Comparison of Additive Trees Using Circular Orders |
CIE
2007
Springer
14 years 1 months ago
2007
Springer
Concerning the set of rooted binary trees, one shows that Higman’s Lemma and Dershowitz’s recursive path ordering can be used for the decision of its maximal order type accordi...
NLP
2000
13 years 11 months ago
2000
In this article we compare the performance of various machine learning algorithms on the task of constructing word-sense disambiguation rules from data. The distinguishing characte...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
ECRIME
2007
13 years 11 months ago
2007
There are many applications available for phishing detection. However, unlike predicting spam, there are only few studies that compare machine learning techniques in predicting ph...
FUIN
2010
13 years 4 months ago
2010
We study an extension of monadic second-order logic of order with the uncountability quantifier "there exist uncountably many sets". We prove that, over the class of fini...