1039 search results - page 15 / 208 » Kernels and Regularization on Graphs |
117
Voted
ICDE
2011
IEEE
14 years 4 months ago
2011
IEEE
—It is increasingly common to find graphs in which edges bear different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries ...
119
click to vote
ICMLA
2009
14 years 10 months ago
2009
This paper introduces a new algorithm, namely the EquiCorrelation Network (ECON), to perform supervised classification, and regression. ECON is a kernelized LARS-like algorithm, b...
95
Voted
ARSCOM
2004
15 years 10 days ago
2004
The domatic number of a graph G is the maximum number of dominating sets into which the vertex set of G can be partitioned. We show that the domatic number of a random r-regular g...
96
Voted
ECCV
2008
Springer
16 years 2 months ago
2008
Springer
This article proposes a new framework to regularize linear inverse problems using the total variation on non-local graphs. This nonlocal graph allows to adapt the penalization to t...
104
click to vote
ESCAPE
2007
Springer
15 years 4 months ago
2007
Springer
In the NP-hard Cluster Editing problem, we have as input an undirected graph G and an integer k 0. The question is whether we can transform G, by inserting and deleting at most k ...