36 search results - page 4 / 8 » Graph embedding using tree edit-union |
IPL
2008
13 years 8 months ago
2008
In this paper, we show how we can derive lower bounds and also compute the exact distortion for the line embeddings of some special metrics, especially trees and graphs with certai...
COCOON
2007
Springer
14 years 2 months ago
2007
Springer
We introduce the concept of colored simultaneous geometric embeddings as a generalization of simultaneous graph embeddings with and without mapping. We show that there exists a uni...
CVPR
2007
IEEE
14 years 10 months ago
2007
IEEE
We propose a manifold learning approach to fiber tract clustering using a novel similarity measure between fiber tracts constructed from dual-rooted graphs. In particular, to gene...
ICDM
2006
IEEE
14 years 2 months ago
2006
IEEE
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
COCOON
1999
Springer
14 years 25 days ago
1999
Springer
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...