335 search results - page 11 / 67 » Kernel Machines and Boolean Functions |
ASPDAC
2005
ACM
13 years 9 months ago
2005
ACM
Abstract— A disjoint support decomposition (DSD) is a representation of a Boolean function F obtained by composing two or more simpler component functions such that the component...
ICPR
2008
IEEE
14 years 1 months ago
2008
IEEE
In this paper, we present a least square kernel machine with box constraints (LSKMBC). The existing least square machines assume Gaussian hyperpriors and subsequently express the ...
IJCNN
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— The generalised linear model (GLM) is the standard approach in classical statistics for regression tasks where it is appropriate to measure the data misfit using a lik...
SCIA
2005
Springer
14 years 29 days ago
2005
Springer
Abstract. We address the problem of incorporating transformation invariance in kernels for pattern analysis with kernel methods. We introduce a new class of kernels by so called Ha...
ML
2002
ACM
13 years 7 months ago
2002
ACM
Matching Pursuit algorithms learn a function that is a weighted sum of basis functions, by sequentially appending functions to an initially empty basis, to approximate a target fu...