Sciweavers

335 search results - page 3 / 67
» Kernel Machines and Boolean Functions
Sort
View
DFG
1992
Springer
13 years 10 months ago
Complexity of Boolean Functions on PRAMs - Lower Bound Techniques
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
Miroslaw Kutylowski
ESANN
2000
13 years 7 months ago
Support Vector Committee Machines
Abstract. This paper proposes a mathematical programming framew ork for combining SVMs with possibly di erent kernels. Compared to single SVMs, the advantage of this approach is tw...
Dominique Martinez, Gilles Millerioux
ICML
2007
IEEE
14 years 7 months ago
A kernel path algorithm for support vector machines
The choice of the kernel function which determines the mapping between the input space and the feature space is of crucial importance to kernel methods. The past few years have se...
Gang Wang, Dit-Yan Yeung, Frederick H. Lochovsky
ML
2007
ACM
144views Machine Learning» more  ML 2007»
13 years 5 months ago
Invariant kernel functions for pattern analysis and machine learning
In many learning problems prior knowledge about pattern variations can be formalized and beneficially incorporated into the analysis system. The corresponding notion of invarianc...
Bernard Haasdonk, Hans Burkhardt