1039 search results - page 35 / 208 » Kernels and Regularization on Graphs |
108
Voted
ADCM
2007
15 years 19 days ago
2007
In this paper, we are interested in the analysis of regularized online algorithms associated with reproducing kernel Hilbert spaces. General conditions on the loss function and st...
68
Voted
APPML
2004
15 years 11 days ago
2004
We study preservation of distance regularity when taking strong sums and strong products of distance-regular graphs. MSC 2000 Classification: 05C12
CORR
2010
Springer
15 years 18 days ago
2010
Springer
We study a general class of problems called F -Deletion problems. In an F -Deletion problem, we are asked whether a subset of at most k vertices can be deleted from a graph G such...
114
click to vote
ICIAR
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Graph cut minimization formulates the segmentation problem as the liner combination of data and smoothness terms. The smoothness term is included in the energy formulatio...
104
Voted
TCS
2008
15 years 12 days ago
2008
Let R be a resolution refutation, given as a sequence of clauses without explicit description of the underlying dag. Then, it is NPcomplete to decide whether R is a regular resolu...