561 search results - page 84 / 113 » Shortest-Path Kernels on Graphs |
ICML
2006
IEEE
14 years 8 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...
KDD
2004
ACM
14 years 7 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...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
We study the problem of discovering a manifold that best preserves information relevant to a nonlinear regression. Solving this problem involves extending and uniting two threads ...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Scaling up the sparse matrix-vector multiplication kernel on modern Graphics Processing Units (GPU) has been at the heart of numerous studies in both academia and industry. In thi...
CIAC
2010
Springer
14 years 4 months ago
2010
Springer
In this paper we consider a natural generalization of the well-known Max Leaf
Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as
input an undirected co...