1039 search results - page 27 / 208 » Kernels and Regularization on Graphs |
106
Voted
ICPR
2008
IEEE
15 years 7 months ago
2008
IEEE
We present a novel method for incorporating prior knowledge about invariances in object recognition for discriminant analysis. In contrast to conventional isotropic regularization...
97
Voted
ICASSP
2009
IEEE
15 years 4 months ago
2009
IEEE
We investigate a method using support vector machines (SVMs) with walk-based graph kernels for high-level feature extraction from images. In this method, each image is first segme...
95
Voted
NIPS
2003
15 years 1 months ago
2003
This paper devises a novel kernel function for structured natural language data. In the field of Natural Language Processing, feature extraction consists of the following two ste...
85
Voted
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper we present a method for impulse noise removal that makes use of spectral clustering and graph regularization. The image is modeled as a graph and local spectral anal...
111
Voted
CPC
2007
15 years 14 days ago
2007
We show that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. The proof uses an efficient algorithm which a.a.s. 3colours a random 4-regular ...