1039 search results - page 22 / 208 » Kernels and Regularization on Graphs |
76
Voted
ICIAR
2007
Springer
15 years 3 months ago
2007
Springer
A discrete regularization framework on graphs is proposed and studied for color image filtering purposes when images are represented by grid graphs. Image filtering is considered...
122
Voted
MST
2006
14 years 9 months ago
2006
We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...
103
click to vote
SDM
2012
SIAM
12 years 12 months ago
2012
SIAM
Random walk graph kernel has been used as an important tool for various data mining tasks including classification and similarity computation. Despite its usefulness, however, it...
JCT
2008
14 years 9 months ago
2008
Let G be a regular graph and H a subgraph on the same vertex set. We give surprisingly compact formulas for the number of copies of H one expects to find in a random subgraph of G...
COMBINATORICS
2000
14 years 9 months ago
2000
In a previous paper it was established that there are at least 27 non-isomorphic strongly regular (40, 12, 2, 4) graphs. Using a different and more efficient method we have re-inv...