The problem of approximate parameterized string searching consists of finding, for a given text t = t1t2 ...tn and pattern p = p1p2 ...pm over respective alphabets Σt and Σp, t...
We investigate the measures of frequency bands of scaling functions and wavelets, and solve an open problem. Furthermore, we give conditions for which the measures of frequency ba...
Nearness (a fuzzy nearness) is a fuzzy relation that can be used to model various grades of “being close” in a linear space. We study the uniform convergence of a sequence of ...
Greedy approximation algorithms have been frequently used to obtain sparse solutions to learning problems. In this paper, we present a general greedy algorithm for solving a class...
When a conflict of duties arises, a resolution is often sought by determining an ordering of priority or importance. This paper examines how such a conflict resolution works, compa...