This paper addresses the issue of learning graph edit distance cost functions for numerically labeled graphs from a corpus of sample graphs. We propose a system of self-organizing maps representing attribute distance spaces that encode edit operation costs. The selforganizing maps are iteratively adapted to minimize the edit distance of those graphs that are required to be similar. To demonstra...

We consider approximate path-reporting distance oracles, distance labeling and labeled routing with extremely low space requirement, for general undirected graphs. For distance oracles, we show how to break the n log n space bound of Thorup and Zwick if approximate paths rather than distances need to be reported. For approximate distance labeling and labeled routing, we break the previously bes...

OBJECTIVE The aim of this study was to evaluate age-related changes in metabolic walking energy expenditure in ambulant boys affected by Duchenne muscular dystrophy over a follow-up period of 12 months. METHODS At baseline (T1) and 12 months later (T2), metabolic walking energy expenditure was assessed during a 6-minute walk test at comfortable speed in 14 ambulant boys with Duchenne (age ran...

This theory is split into two sections. In the first section, we give a formal proof that a well-known axiomatic characterization of the single-source shortest path problem is correct. Namely, we prove that in a directed graph G = (V,E) with a non-negative cost function on the edges the single-source shortest path function μ : V → R ∪ {∞} is the only function that satisfies a set of four axioms...

Long-distance telephone companies in the United States (U.S.) pay access fees to local telephone companies to transport calls that originate and terminate on their networks. These charges form the largest portion of the cost of providing long-distance service. Recent changes in the structure of access rates, which were mandated by the Federal Communications Commission (FCC), have created opport...

In this paper, we propose and evaluate various distanceaware weighting strategies to improve reconstruction accuracy of a voxelbased model according to the Truncated Signed Distance Function (TSDF), from the data obtained by low-cost depth sensors. We look at two strategy directions: (a) weight definition strategies prioritizing importance of the sensed data depending on the data accuracy, and ...

(a) Input image (b) Scaling (c) Visibility map for (d) (d) Seam carving (e) Visibility map for (f) (f) Seam carving energy terms (distortion energy: absolute magnitude distance, nD = 1) (g) Visibility map for (h) (h) Distortion energy: absolute magnitude distance, nD = 1; unary with nU = 1 (i) Visibility map for (j) (j) Distortion energy: absolute magnitude distance, nD = 1; seam term: repeat c...

In this paper we propose the problem of finding the cyclic sequence which best represents a set of cyclic sequences. Given a set of elements and a precedence cost matrix we look for the cyclic sequence of the elements which is at minimum distance from all the ranks when the permutation metric distance is the Kendall Tau distance. In other words, the problem consists of finding a robust cyclic r...

Forward head posture (FHP) is representative bad habit causing neck pain, shoulder pain, back pain, dental occlusion, headache etc in modern society. Approaches to prevent FHP were researched by camera sensors such as Kinect and Webcam, which has cost and space limitation caused by installation of the sensors. To compensate the limitations, we proposed wearable device to put it behind user’s ea...

Software cost estimation nowadays plays a more and more important role in practical projects since modern software projects become more and more complex as well as diverse. To help estimate software development cost accurately, this research does a systematic analysis of the similarity distances in analogy-based software cost estimation and based on this, a new non-orthogonal space distance (No...