412 search results - page 62 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
80
Voted
ICML
2008
IEEE
16 years 17 days ago
2008
IEEE
Inspired by co-training, many multi-view semi-supervised kernel methods implement the following idea: find a function in each of multiple Reproducing Kernel Hilbert Spaces (RKHSs)...
NIPS
1998
15 years 1 months ago
1998
The kernel-parameter is one of the few tunable parameters in Support Vector machines, controlling the complexity of the resulting hypothesis. Its choice amounts to model selection...
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
—This paper deals with optimized training sequences to estimate multiple-input multiple-output orthogonal frequencydivision multiplexing (MIMO-OFDM) channel states in the presenc...
CVPR
2005
IEEE
16 years 1 months ago
2005
IEEE
We propose a simple model of human motion as a switching linear dynamical system where the switches correspond to contact forces with the ground. This significantly improves the m...
PKDD
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...