654 search results - page 29 / 131 » Matrix Graph Grammars |
APVIS
2008
13 years 10 months ago
2008
We present the Zoomable Adjacency Matrix Explorer (ZAME), a visualization tool for exploring graphs at a scale of millions of nodes and edges. ZAME is based on an adjacency matrix...
ER
1993
Springer
14 years 28 days ago
1993
Springer
Two major problems in schema integration are to identify correspondences between different conceptual schemas and to verify that the proposed correspondences are consistent with th...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
Wigderson and Xiao presented an efficient derandomization of the matrix Chernoff bound using the method of pessimistic estimators [WX08]. Building on their construction, we prese...
PAKDD
2007
ACM
14 years 3 months ago
2007
ACM
This work presents a kernel method for clustering the nodes of a weighted, undirected, graph. The algorithm is based on a two-step procedure. First, the sigmoid commute-time kernel...
ICVS
2003
Springer
14 years 2 months ago
2003
Springer
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...