4 search results - page 1 / 1 » Fast Neighborhood Subgraph Pairwise Distance Kernel |
ICML
2010
IEEE
13 years 5 months ago
2010
IEEE
We introduce a novel graph kernel called the Neighborhood Subgraph Pairwise Distance Kernel. The kernel decomposes a graph into all pairs of neighborhood subgraphs of small radius...
SIGMOD
2011
ACM
12 years 7 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
IM
2008
13 years 4 months ago
2008
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...
ICIP
2002
IEEE
14 years 6 months ago
2002
IEEE
This paper proposes an algorithm for recognizing Chinese characters in many diverse fonts including Song, Fang, Kai, Hei, Yuan, Lishu, Weibei, and Xingkai. The algorithm is based ...