704 search results - page 13 / 141 » Isometrically Embedded Graphs |
ECCV
2004
Springer
14 years 9 months ago
2004
Springer
In recent work, we presented a framework for many-to-many matching of multi-scale feature hierarchies, in which features and their relations were captured in a vertex-labeled, edge...
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
We present a simple factor 6 algorithm for approximating the optimal multiplicative distortion of embedding (unweighted) graph metrics into tree metrics (thus improving and simplif...
VLDB
2012
ACM
12 years 3 months ago
2012
ACM
The growing popularity of graph databases has generated interesting data management problems, such as subgraph search, shortest path query, reachability verification, and pattern ...
COMPGEOM
2007
ACM
13 years 11 months ago
2007
ACM
CIE
2008
Springer
13 years 9 months ago
2008
Springer
A computable graph is computably categorical if any two computable presentations of the graph are computably isomorphic. In this paper we investigate the class of computably catego...