3415 search results - page 105 / 683 » Lower Bounds for Kernelizations |
58
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
89
Voted
EOR
2011
14 years 4 months ago
2011
131
Voted
TIT
2008
15 years 23 days 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...
105
click to vote
FAW
2009
Springer
15 years 5 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...
86
Voted
NIPS
2001
15 years 2 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...