1542 search results - page 109 / 309 » Kernelization of packing problems |
MST
2007
15 years 1 months ago
2007
Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...
107
click to vote
ICML
2007
IEEE
16 years 2 months ago
2007
IEEE
We study the problem of discovering a manifold that best preserves information relevant to a nonlinear regression. Solving this problem involves extending and uniting two threads ...
131
click to vote
STACS
2007
Springer
15 years 7 months ago
2007
Springer
In this paper, it is shown that the Feedback Vertex Set problem on unweighted, undirected graphs has a kernel of cubic size. I.e., a polynomial time algorithm is described, that, w...
105
click to vote
TKDE
2008
15 years 1 months ago
2008
Linear and kernel discriminant analyses are popular approaches for supervised dimensionality reduction. Uncorrelated and regularized discriminant analyses have been proposed to ove...
133
click to vote
PAMI
2010
15 years 15 hour ago
2010
—A new formulation for multiway spectral clustering is proposed. This method corresponds to a weighted kernel principal component analysis (PCA) approach based on primal-dual lea...