1275 search results - page 139 / 255 » Chunking with Decision Trees |
111
click to vote
STOC
2004
ACM
15 years 11 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
PKDD
2009
Springer
15 years 5 months ago
2009
Springer
Subgroup discovery aims at finding subsets of a population whose class distribution is significantly different from the overall distribution. It has previously predominantly been...
ISVC
2007
Springer
15 years 5 months ago
2007
Springer
In this paper, we present a facial expression recognition method using feature-adaptive motion energy analysis. Our method is simplicityoriented and avoids complicated face model r...
COCO
2004
Springer
15 years 4 months ago
2004
Springer
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
CIE
2006
Springer
15 years 2 months ago
2006
Springer
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...