50 search results - page 6 / 10 » Kernelization Algorithms for the Vertex Cover Problem: Theor... |
FOCM
2006
13 years 7 months ago
2006
This paper considers the regularized learning algorithm associated with the leastsquare loss and reproducing kernel Hilbert spaces. The target is the error analysis for the regres...
ALGORITHMICA
2006
13 years 7 months ago
2006
Algorithmic methods based on the theory of fixed-parameter tractability are combined with powerful computational platforms to launch systematic attacks on combinatorial problems o...
KDD
2007
ACM
14 years 7 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
STOC
2006
ACM
14 years 7 months ago
2006
ACM
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
ICPR
2006
IEEE
14 years 8 months ago
2006
IEEE
1 A kernel determines the inductive bias of a learning algorithm on a specific data set, and it is beneficial to design specific kernel for a given data set. In this work, we propo...