3415 search results - page 105 / 683 » Lower Bounds for Kernelizations |
CORR
2011
Springer
14 years 9 months ago
2011
Springer
145
Voted
EOR
2011
14 years 9 months ago
2011
193
click to vote
TIT
2008
15 years 6 months ago
2008
We consider a framework for semi-supervised learning using spectral decomposition-based unsupervised kernel design. We relate this approach to previously proposed semi-supervised l...
156
click to vote
FAW
2009
Springer
15 years 10 months ago
2009
Springer
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
141
click to vote
NIPS
2001
15 years 7 months ago
2001
We propose randomized techniques for speeding up Kernel Principal Component Analysis on three levels: sampling and quantization of the Gram matrix in training, randomized rounding...