1154 search results - page 218 / 231 » On the editing distance of graphs |
NETWORKS
2010
13 years 6 months ago
2010
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
SWAT
2010
Springer
13 years 5 months ago
2010
Springer
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...
ICPR
2010
IEEE
13 years 5 months ago
2010
IEEE
Similarity based pattern recognition is concerned with the analysis of patterns that are specified in terms of object dissimilarity or proximity rather than ordinal values. For man...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
To minimize the number of wavelengths required by a multicast session in sparse light splitting Wavelength Division Multiplexing (WDM) networks, a light-hierarchy structure, which ...
ACCV
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. This paper describes a method for topology-free shape morphing based on region cluster-based Earth Mover's Distance (EMD) flows, since existing methods for closed cu...