1275 search results - page 139 / 255 » Chunking with Decision Trees |
194
click to vote
STOC
2004
ACM
16 years 6 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, ...
137
click to vote
PKDD
2009
Springer
16 years 17 days 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...
170
click to vote
ISVC
2007
Springer
16 years 5 days 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...
161
click to vote
COCO
2004
Springer
15 years 11 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...
159
click to vote
CIE
2006
Springer
15 years 9 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...