This work investigates the continuous-state counterpart of the discrete randomized shortest-path framework (RSP, [23]) on a graph. Given a weighted directed graph G, the RSP considers the policy that… (More)

This paper proposes a simple extension of the celebrated MINIMAX algorithm used in zero-sum two-player games, called Rminimax. The Rminimax algorithm allows controlling the strength of an artificial… (More)

In this paper, normalized SoP string-edit distances, taking into account all possible alignments between two sequences, are investigated. These normalized distances are variants of the Sum-over-Paths… (More)

IEEE Transactions on Pattern Analysis and Machine…

2013

This work introduces a novel nonparametric density index defined on graphs, the Sum-over-Forests (SoF) density index. It is based on a clear and intuitive idea: high-density regions in a graph are… (More)

This work introduces a simple Sum-over-Paths (SoP) formulation of string edit distances accounting for all possible alignments between two sequences. Each alignment ℘, with a total cost C(℘), is… (More)

This paper introduces a novel methodology for music similarity retrieval based on chord progressions. From each chord progression, a directed labeled graph containing the interval transitions is… (More)