A software fingerprint is a set of distinctive characteristics used to identify and compare programs. This paper presents a fingerprint technique based on the characteristics of method signatures. The proposed technique considers uncommon method signatures as being more effective than common ones to compare programs. The implementation of this technique is limited to Java programs, but it could...

The notion of (circular) colorings of edge-weighted graphs is introduced. This notion generalizes the notion of (circular) colorings of graphs, the channel assignment problem, and several other optimization problems. For instance, its restriction to colorings of weighted complete graphs corresponds to the traveling salesman problem (metric case). It also gives rise to a new definition of the ch...

Routing metrics of multi-hop wireless networks differ from traditional routing metrics due to dynamic and unpredictable nature of wireless media. Many routing metrics were proposed for single-radio as well as multi-radio mesh networks. In this paper we study various routing metrics such as Expected Transmission Count (ETX) metric, Expected Transmission Time (ETT), Weighted cumulative ETT (WCETT...

introduce a multi-scale metric on a space equipped with a diffusion semigroup. We prove, under some technical conditions, that the norm dual to the space of Lipschitz functions with respect to this metric is equivalent to two other norms, one of which is a weighted sum of the averages at each scale, and one of which is a weighted sum of the difference of averages across scales. The notion of 's...

We improve hardness results for the problem of embedding one finite metric into another with minimum distortion. This problem is equivalent to optimally embedding one weighted graph into another under the shortest path metric. We show that unless P = NP, the minimum distortion of embedding one such graph into another cannot be efficiently approximated within a factor less than 9/4 even when the...

• The all-pairs shortest paths problem on weighted digraphs (APSP). • Detecting if a weighted graph has a triangle of negative total edge weight. • Listing up to n2.99 negative triangles in an edge-weighted graph. • Finding a minimum weight cycle in a graph of non-negative edge weights. • The replacement paths problem on weighted digraphs. • Finding the second shortest simple path between two n...

2 Euclidean structures 3 2.1 Basic definitions . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.2 Weighted triangulations . . . . . . . . . . . . . . . . . . . . . . . 4 2.3 Thurston triangulations . . . . . . . . . . . . . . . . . . . . . . . 5 2.4 Duality triangulations . . . . . . . . . . . . . . . . . . . . . . . . 6 2.5 Equivalence of metric triangulations . . . . . . . . . . . . ...