1039 search results - page 108 / 208 » Kernels and Regularization on Graphs |
145
click to vote
ESA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...
135
Voted
SSPR
1998
Springer
15 years 8 months ago
1998
Springer
This paper presents a probabilistic similarity measure for object recognition from large libraries of line-patterns. We commence from a structural pattern representation which use...
116
click to vote
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
The kernel Perceptron is an appealing online learning algorithm that has a drawback: whenever it makes an error it must increase its support set, which slows training and testing ...
148
click to vote
PAMI
2010
15 years 2 months ago
2010
—Adapting the hyperparameters of support vector machines (SVMs) is a challenging model selection problem, especially when flexible kernels are to be adapted and data are scarce....
134
click to vote
COMBINATORICA
2006
15 years 3 months ago
2006
Let T be a fixed tournament on k vertices. Let D(n, T) denote the maximum number of orientations of an n-vertex graph that have no copy of T. We prove that D(n, T) = 2tk-1(n) for ...