1039 search results - page 39 / 208 » Kernels and Regularization on Graphs |
172
click to vote
EJC
2011
15 years 28 days ago
2011
Henning and Yeo proved a lower bound for the minimum size of a maximum matching in a connected k-regular graphs with n vertices; it is sharp infinitely often. In an earlier paper...
194
click to vote
PKDD
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The eigenspectrum of a graph Laplacian encodes smoothness information over the graph. A natural approach to learning involves transforming the spectrum of a graph Laplaci...
131
click to vote
DAGM
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. During recent years much effort has been spent in incorporating problem specific a-priori knowledge into kernel methods for machine learning. A common example is a-prior...
141
click to vote
ICDCIT
2005
Springer
15 years 11 months ago
2005
Springer
In this paper, we consider a contaminated network with an intruder. The task for the mobile agents is to decontaminate all hosts while preventing a recontamination and to do so as ...
140
click to vote
ICIP
2007
IEEE
16 years 8 days ago
2007
IEEE
This paper develops a classification algorithm in the framework of spectral graph theory where the underlying manifold of a high dimensional data set is described by a graph. The...