9949 search results - page 297 / 1990 » On the Network Complexity of Selection |
148
click to vote
IJHIS
2008
15 years 6 months ago
2008
Meta-Learning has been successfully applied to acquire knowledge used to support the selection of learning algorithms. Each training example in Meta-Learning (i.e. each meta-exampl...
242
click to vote
ML
2002
ACM
15 years 6 months ago
2002
ACM
We present a general approach to model selection and regularization that exploits unlabeled data to adaptively control hypothesis complexity in supervised learning tasks. The idea ...
190
click to vote
EMSOFT
2010
Springer
15 years 4 months ago
2010
Springer
We propose the first polynomial-time code selection algorithm for minimising the worst-case execution time of a nonnested loop executed on a fully pipelined processor that uses sc...
146
click to vote
WEBI
2010
Springer
15 years 4 months ago
2010
Springer
The ESP game belongs to the genre called Games with a Purpose (GWAP), which leverage people's desire to be entertained and also outsource certain steps of the computational p...
167
click to vote
JISE
2010
15 years 1 months ago
2010
In dealing with large datasets the reduced support vector machine (RSVM) was proposed for the practical objective to overcome the computational difficulties as well as to reduce t...