Sciweavers

ARSCOM
2006
91views more  ARSCOM 2006»
13 years 4 months ago
Binary codes from graphs on triples and permutation decoding
We show that permutation decoding can be used, and give explicit PD-sets in the symmetric group, for some of the binary codes obtained from the adjacency matrices of the graphs on...
Jennifer D. Key, Jamshid Moori, Bernardo Gabriel R...
CIDM
2009
IEEE
13 years 8 months ago
Faster computation of the direct product kernel for graph classification
The direct product kernel, introduced by G
Nikhil S. Ketkar, Lawrence B. Holder, Diane J. Coo...
ICVS
2003
Springer
13 years 9 months ago
A Spectral Approach to Learning Structural Variations in Graphs
This paper shows how to construct a linear deformable model for graph structure by performing principal components analysis (PCA) on the vectorised adjacency matrix. We commence b...
Bin Luo, Richard C. Wilson, Edwin R. Hancock