1039 search results - page 91 / 208 » Kernels and Regularization on Graphs |
91
Voted
MST
2007
15 years 7 days 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...
100
Voted
ICML
2006
IEEE
16 years 1 months ago
2006
IEEE
The power and popularity of kernel methods stem in part from their ability to handle diverse forms of structured inputs, including vectors, graphs and strings. Recently, several m...
104
Voted
KDD
2004
ACM
16 years 1 months ago
2004
ACM
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
110
Voted
APPML
2006
15 years 24 days ago
2006
An eigenvalue of a graph G is called a main eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero, and it is well known that a graph has exactly one ma...
76
Voted
DM
2011
14 years 7 months ago
2011
We show that there exists a family of r-regular graphs of arbitrarily large excessive index for each integer r greater than 3. Furthermore, we answer a question in [1] showing tha...