Sciweavers

1542 search results - page 65 / 309
» Kernelization of packing problems
Sort
View
ESCAPE
2007
Springer
256views Algorithms» more  ESCAPE 2007»
15 years 3 months ago
A More Effective Linear Kernelization for Cluster Editing
In the NP-hard Cluster Editing problem, we have as input an undirected graph G and an integer k 0. The question is whether we can transform G, by inserting and deleting at most k ...
Jiong Guo
IJCNN
2007
IEEE
15 years 6 months ago
Probability Density Function Estimation Using Orthogonal Forward Regression
— Using the classical Parzen window estimate as the target function, the kernel density estimation is formulated as a regression problem and the orthogonal forward regression tec...
Sheng Chen, Xia Hong, Chris J. Harris
ECML
2004
Springer
15 years 3 months ago
Efficient Hyperkernel Learning Using Second-Order Cone Programming
The kernel function plays a central role in kernel methods. Most existing methods can only adapt the kernel parameters or the kernel matrix based on empirical data. Recently, Ong e...
Ivor W. Tsang, James T. Kwok
KDD
2006
ACM
181views Data Mining» more  KDD 2006»
16 years 8 days ago
Cryptographically private support vector machines
We study the problem of private classification using kernel methods. More specifically, we propose private protocols implementing the Kernel Adatron and Kernel Perceptron learning ...
Helger Lipmaa, Sven Laur, Taneli Mielikäinen
ICPR
2008
IEEE
15 years 6 months ago
Object recognition using graph spectral invariants
Graph structures have been proved important in high level-vision since they can be used to represent structural and relational arrangements of objects in a scene. One of the probl...
Bai Xiao, Richard C. Wilson, Edwin R. Hancock