We propose a quantum algorithm for closest pattern matching which allows us to search for as many distinct patterns as we wish in a given string (database), requiring a query function per symbol of the pattern alphabet. This represents a significant practical advantage when compared to Grover’s search algorithm as well as to other quantum pattern matching methods [7], which rely on building spe...

This study introduces an effective population-based optimization algorithm, namely the Golden Search Optimization Algorithm (GSO), for numerical function optimization. The new algorithm has a simple but strategy solving complex problems. GSO starts with random possible solutions called objects, which interact each other based on mathematical model to reach global optimum. To provide fine balanc...

Fast motion estimation technique plays a very important part in video compression standard. In this paper, we propose a novel algorithm using octagon-based search (OCTBS) pattern for fast block motion estimation. The proposed OCTBS algorithm can find motion vector with fewer search points than the diamond search (DS) algorithm. The speedup gain of the OCTBS method over the DS algorithm is more ...

Nearest neighbour search is a simple technique widely used in Pattern Recognition tasks. When the dataset is large and/or the dissimilarity computation is very time consuming the brute force approach is not practical. In such cases, some properties of the dissimilarity measure can be exploited in order to speed up the search. In particular, the metric properties of some dissimilarity measures h...

fi A hyperclique pattern [12] is a new type of association pattern that contains items which are highly affiliated with each other. More specifically, the presence of an item in one transaction strongly implies the presence of every other item that belongs to the same hyperclique pattern. In this paper, we present a new algorithm for mining maximal hyperclique patterns, which are desirable for ...

Pattern matching problem is still very interesting and important problem. Algorithms for the exact pattern matching search for exact patterns in some texts or figures. Algorithms for an approximate pattern matching search for exact and similar patterns with some errors. They use some measures to evaluate a similarity of found similar patterns. In the area of the pattern matching allowing errors...