9842 search results - page 328 / 1969 » Problem complexity |
231
click to vote
ALT
2011
Springer
14 years 6 months ago
2011
Springer
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...
165
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
We describe a reduction from the problem of unordered search (with a unique solution) to the problem of inverting a permutation. Since there is a straightforward reduction in the ...
162
click to vote
IJCNN
2007
IEEE
16 years 1 months ago
2007
IEEE
—The Support Vector Machine is a widely employed machine learning model due to its repeatedly demonstrated superior generalization performance. The Sequential Minimal Optimizatio...
213
click to vote
ITS
2004
Springer
16 years 5 days ago
2004
Springer
This research describes a probabilistic approach for developing predictive models of how students learn problem-solving skills in general qualitative chemistry. The goal is to use ...
201
click to vote
RTSS
2003
IEEE
16 years 2 days ago
2003
IEEE
The Pfair algorithms are optimal for independent periodic real-time tasks executing on a multiple-resource system, however, they incur a high scheduling overhead by making schedul...