214 search results - page 1 / 43 » A measure of similarity between graph vertices |
CORR
2004
Springer
13 years 4 months ago
2004
Springer
We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with, respectively, nA and nB vertices. We define an nB
WEBI
2009
Springer
13 years 9 months ago
2009
Springer
— This paper presents a novel method of generating extractive summaries for multiple documents. Given a cluster of documents, we firstly construct a graph where each vertex repre...
GBRPR
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Graph matching is often used for image recognition. Different kinds of graph matchings have been proposed such as (sub)graph isomorphism or error-tolerant graph matching...
COMPGEOM
2010
ACM
13 years 9 months ago
2010
ACM
We study the problem of computing the similarity between two piecewise-linear bivariate functions defined over a common domain, where the surfaces they define in 3D—polyhedral...
EMNLP
2008
13 years 6 months ago
2008
We consider a parsed text corpus as an instance of a labelled directed graph, where nodes represent words and weighted directed edges represent the syntactic relations between the...