152 search results - page 1 / 31 » Similarity Matrices for Pairs of Graphs |
ICALP
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. 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 a nA × nB...
UAI
2003
13 years 6 months ago
2003
Recently, spectral clustering (a.k.a. normalized graph cut) techniques have become popular for their potential ability at finding irregularlyshaped clusters in data. The input to...
CPM
2008
Springer
13 years 6 months ago
2008
Springer
Let G be an unweighted and undirected graph of n nodes, and let D be the n
AVI
2008
13 years 5 months ago
2008
Programming assignments are easy to plagiarize in such a way as to foil casual reading by graders. Graders can resort to automatic plagiarism detection systems, which can generate...
IJFCS
2006
13 years 4 months ago
2006
Abstract. Local similarity computation between two sequences permits detecting all the relevant alignments present between subsequences thereof. A well-known dynamic programming al...