32 search results - page 4 / 7 » Calculating the VC-dimension of decision trees |
CIDM
2009
IEEE
13 years 11 months ago
2009
IEEE
Abstract-- Automatic recognition of activities using time series data collected from exercise can facilitate development of applications that motivate people to exercise more frequ...
ECAI
2000
Springer
13 years 11 months ago
2000
Springer
In this paper, an editing algorithm based on the projection of the examples in each dimension is presented. The algorithm, that we have called EOP (Editing by Ordered Projection) h...
SAC
2002
ACM
13 years 7 months ago
2002
ACM
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
COLT
2001
Springer
13 years 12 months ago
2001
Springer
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...
ISVC
2007
Springer
14 years 1 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...