4903 search results - page 132 / 981 » The Set Covering Machine |
124
Voted
NIPS
2007
15 years 4 months ago
2007
To accelerate the training of kernel machines, we propose to map the input data to a randomized low-dimensional feature space and then apply existing fast linear methods. The feat...
137
Voted
MSCS
2010
15 years 1 months ago
2010
ABSTRACT. In this note we prove that any Turing machine which uses only a finite computational space for every input cannot solve an uncomputable problem even in case it runs in a...
118
Voted
CVPR
2008
IEEE
16 years 4 months ago
2008
IEEE
Nearest neighbour classifiers and related kernel methods often perform poorly in high dimensional problems because it is infeasible to include enough training samples to cover the...
120
Voted
FSKD
2007
Springer
15 years 8 months ago
2007
Springer
Naïve Bayes is a well-known effective and efficient classification algorithm, but its probability estimation performance is poor. Averaged One-Dependence Estimators, simply AODE,...
106
click to vote
RAID
2004
Springer
15 years 8 months ago
2004
Springer
Worm detection systems have traditionally used global strategies and focused on scan rates. The noise associated with this approach requires statistical techniques and large data s...