1039 search results - page 30 / 208 » Kernels and Regularization on Graphs |
94
Voted
MFCS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We present algorithmic lower bounds on the size of the largest independent sets of vertices in a random d-regular graph. Our bounds hold with probability approaching one ...
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
In the framework of the interactive search in image databases, we are interested in similarity measures able to learn during the search and usable in real-time. Images are represe...
ISAAC
2007
Springer
15 years 6 months ago
2007
Springer
In an edge deletion problem one is asked to delete at most k edges from a given graph such that the resulting graph satisfies a certain property. In this work, we study four NP-co...
96
Voted
RSA
2010
14 years 11 months ago
2010
We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and deri...
113
click to vote
ICML
2004
IEEE
16 years 1 months ago
2004
IEEE
Kernel conditional random fields (KCRFs) are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models...