1039 search results - page 20 / 208 » Kernels and Regularization on Graphs |
RSA
2006
14 years 9 months ago
2006
In this paper, we prove that there exists a function k = (4 + o(1))k such that G(n, /n) contains a k-regular graph with high probability whenever > k. In the case of k = 3, it...
RSA
2011
14 years 4 months ago
2011
An old problem of Erd˝os, Fajtlowicz and Staton asks for the order of a largest induced regular subgraph that can be found in every graph on n vertices. Motivated by this problem...
WG
2001
Springer
15 years 1 months ago
2001
Springer
We consider an edge-isoperimetric problem (EIP) on the cartesian powers of graphs. One of our objectives is to extend the list of graphs for whose cartesian powers the lexicograph...
CORR
2010
Springer
14 years 4 months ago
2010
Springer
Recent research on multiple kernel learning has lead to a number of approaches for combining kernels in regularized risk minimization. The proposed approaches include different for...
106
click to vote
NN
2010
Springer
14 years 4 months ago
2010
Springer
Kernelized LASSO (Least Absolute Selection and Shrinkage Operator) has been investigated in two separate recent papers (Gao et al., 2008) and (Wang et al., 2007). This paper is co...