587 search results - page 26 / 118 » On the Relative Sizes of Learnable Sets |
NIPS
2008
13 years 10 months ago
2008
We study the behavior of block 1/ 2 regularization for multivariate regression, where a K-dimensional response vector is regressed upon a fixed set of p covariates. The problem of...
AAAI
2000
13 years 10 months ago
2000
The random k-SAT model is extensively used to compare satisfiability algorithms or to find the best settings for the parameters of some algorithm. Conclusions are derived from the...
COCO
2003
Springer
14 years 1 months ago
2003
Springer
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...
SIGIR
2006
ACM
14 years 2 months ago
2006
ACM
Modern retrieval test collections are built through a process called pooling in which only a sample of the entire document set is judged for each topic. The idea behind pooling is...
ICPR
2008
IEEE
14 years 3 months ago
2008
IEEE
With the increase of the training set’s size, the efficiency of support vector machine (SVM) classifier will be confined. To solve such a problem, a novel preextracting method f...