Sciweavers

250 search results - page 31 / 50
» Constructing a Class of Symmetric Graphs
Sort
View
JAL
2006
100views more  JAL 2006»
13 years 8 months ago
Distance and routing labeling schemes for non-positively curved plane graphs
Distance labeling schemes are schemes that label the vertices of a graph with short labels in such a way that the distance between any two vertices u and v can be determined effic...
Victor Chepoi, Feodor F. Dragan, Yann Vaxès
CVPR
2006
IEEE
14 years 10 months ago
Graph Laplacian Kernels for Object Classification from a Single Example
Classification with only one labeled example per class is a challenging problem in machine learning and pattern recognition. While there have been some attempts to address this pr...
Hong Chang, Dit-Yan Yeung
WABI
2009
Springer
162views Bioinformatics» more  WABI 2009»
14 years 3 months ago
Aligning Biomolecular Networks Using Modular Graph Kernels
Comparative analysis of biomolecular networks constructed using measurements from different conditions, tissues, and organisms offer a powerful approach to understanding the stru...
Fadi Towfic, M. Heather West Greenlee, Vasant Hona...
ASIAMS
2007
IEEE
14 years 2 months ago
Broadcasting in (n, k)-Arrangement Graph Based on an Optimal Spanning Tree
The tree structure has received much interest as a versatile architecture for a large class of parallel processing applications. Spanning trees in particular are essential tools f...
Jingli Li, Yonghong Xiang, Manli Chen, Yongheng Zh...
DM
2008
112views more  DM 2008»
13 years 8 months ago
Orbit-counting polynomials for graphs and codes
We construct an "orbital Tutte polynomial" associated with a dual pair M and M of matrices over a principal ideal domain R and a group G of automorphisms of the row spac...
Peter J. Cameron, Bill Jackson, Jason D. Rudd