3415 search results - page 169 / 683 » Lower Bounds for Kernelizations |
122
click to vote
ISAAC
2005
Springer
15 years 10 months ago
2005
Springer
In this paper, we prove for the first time that the learning complexity of Rocchio’s algorithm is O(d+d2 (log d+log n)) over the discretized vector space {0, . . . , n − 1}d ,...
122
click to vote
STOC
1999
ACM
15 years 9 months ago
1999
ACM
In this paper we prove a theorem that gives an (almost) tight upper bound on the sensitivity of a multiple-output Boolean function in terms of the sensitivity of its coordinates an...
130
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
This paper presents how to extract non-linear features by linear PCA. KPCA is effective but the computational cost is the drawback. To realize both non-linearity and low computati...
150
Voted
IJON
2007
15 years 4 months ago
2007
This paper addresses the problem of variable ranking for Support Vector Regression. The relevance criteria that we proposed are based on leave-one-out bounds and some variants and...
122
Voted
ICC
2009
IEEE
15 years 11 months ago
2009
IEEE
—In this paper, we investigate the effects of imperfect knowledge of the channel covariance matrix on the performance of a linear minimum mean-square-error (MMSE) estimator for m...