214 search results - page 16 / 43 » A measure of similarity between graph vertices |
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
This work presents a systematic comparison between seven kernels (or similarity matrices) on a graph, namely the exponential diffusion kernel, the Laplacian diffusion kernel, the ...
COCOA
2008
Springer
13 years 9 months ago
2008
Springer
In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k 2, a graph G = (VG, EG) is the k-simplicial power of a graph H = (V...
EMNLP
2007
13 years 8 months ago
2007
Many systems for tasks such as question answering, multi-document summarization, and information retrieval need robust numerical measures of lexical relatedness. Standard thesauru...
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
Abstract. Shape retrieval/matching is a very important topic in computer vision. The recent progress in this domain has been mostly driven by designing smart features for providing...
TIP
2008
13 years 7 months ago
2008
We provide a detailed analysis of the use of minimal spanning graphs as an alignment method for registering multimodal images. This yields an efficient graph theoretic algorithm th...