In the Minimum Common String Partition problem (MCSP) we are given two strings on input, and we wish to partition them into the same collection of substrings, minimizing the numbe...
In this paper, we propose an approximation of the relative phase probability function (RP pdf) and use it to find a non-iterative estimator for the concentration parameter of the...
Abstract--Suppose for a given classification or function approximation (FA) problem data are collected using sensors. From the output of the th sensor, features are extracted, ther...
Abstract. In this paper, we present a method for the automatic acquisition of semantic-based reformulations from natural language questions. Our goal is to find useful and generic ...
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...