1039 search results - page 21 / 208 » Kernels and Regularization on Graphs |
59
Voted
COMBINATORICS
2007
14 years 9 months ago
2007
Let G be a simple balanced bipartite graph on 2n vertices, δ = δ(G)/n, and ρ0 = δ+ √ 2δ−1 2 . If δ ≥ 1/2 then G has a ρ0n -regular spanning subgraph. The statement is...
ESA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We show that the k-Dominating Set problem is fixed parameter tractable (FPT) and has a polynomial kernel for any class of
73
Voted
CIDM
2009
IEEE
15 years 1 months ago
2009
IEEE
The direct product kernel, introduced by G
120
click to vote
CORR
2004
Springer
14 years 9 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
117
click to vote
ESANN
2007
14 years 11 months ago
2007
One-class support vector machines (1-SVMs) estimate the level set of the underlying density observed data. Aside the kernel selection issue, one difficulty concerns the choice of t...