Sciweavers

281 search results - page 8 / 57
» Graph Kernels
Sort
View
156
Voted
ESA
2009
Springer
131views Algorithms» more  ESA 2009»
16 years 28 days ago
Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
Abstract. We show that the k-Dominating Set problem is fixed parameter tractable (FPT) and has a polynomial kernel for any class of
Geevarghese Philip, Venkatesh Raman, Somnath Sikda...
157
Voted
CIDM
2009
IEEE
15 years 10 months ago
Faster computation of the direct product kernel for graph classification
The direct product kernel, introduced by G
Nikhil S. Ketkar, Lawrence B. Holder, Diane J. Coo...
161
Voted
WG
2010
Springer
15 years 4 months ago
On the Small Cycle Transversal of Planar Graphs
We consider the problem of finding a k-edge transversal set that covers all (simple) cycles of length at most s in a planar graph, where s ≥ 3 is a constant. This problem, refe...
Ge Xia, Yong Zhang
186
Voted
ICML
2004
IEEE
16 years 7 months ago
Kernel conditional random fields: representation and clique selection
Kernel conditional random fields (KCRFs) are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models...
John D. Lafferty, Xiaojin Zhu, Yan Liu
165
Voted
NIPS
2003
15 years 7 months ago
Kernels for Structured Natural Language Data
This paper devises a novel kernel function for structured natural language data. In the field of Natural Language Processing, feature extraction consists of the following two ste...
Jun Suzuki, Yutaka Sasaki, Eisaku Maeda