281 search results - page 24 / 57 » Graph Kernels |
138
click to vote
STACS
2007
Springer
15 years 8 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...
137
click to vote
NIPS
2008
15 years 3 months ago
2008
For supervised and unsupervised learning, positive definite kernels allow to use large and potentially infinite dimensional feature spaces with a computational cost that only depe...
145
Voted
ICML
2010
IEEE
15 years 3 months ago
2010
IEEE
Existing approaches to analyzing the asymptotics of graph Laplacians typically assume a well-behaved kernel function with smoothness assumptions. We remove the smoothness assumpti...
132
Voted
SODA
2012
ACM
13 years 5 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
135
click to vote
ICIP
2009
IEEE
15 years 7 days ago
2009
IEEE
The development of street-level geoviewers become recently a very active and challenging research topic. In this context, the detection, representation and classification of windo...