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...
String matching with mismatches is a basic concept of information retrieval with some kinds of approximation. This paper proposes an FFT-based algorithm for the problem of string ...
The mismatch between training and test environmental conditions presents a challenge to speech recognition systems. In this paper, we investigate an approach for matching the dist...
In domains with insufficient matched training data, language models are often constructed by interpolating component models trained from partially matched corpora. Since the ngram...
Orthogonal frequency division multiplexing (OFDM) signals are very sensitive to radio frequency (RF) impairments. One of the major impairments is the mismatching errors between the...