Comparing face images using the Hausdorff distance is one of the face matching and fast screening techniques. As a fast screening technique, the computational efficiency is a key issue. An efficient method for Hausdorff distance-based face matching and fast screening is proposed. The method utilises dominant points, instead of edge maps, as features for measuring similarity. A new formulation o...

In this paper, we propose fast string matching system using GPU for large scale string matching. The key of our proposed system is the use of bit-parallel pattern matching approach for compact NFA representation and fast simulation of NFA transition on GPU. In the experiments, we show the usefulness of our proposed pattern matching system.

The advent of digital computers has made the routine use of pattern-matching possible in various applications. This has also stimulated the development of many algorithms. In this paper, we propose a new algorithm that offers improved performance compared to those reported in the literature so far. The new algorithm has been evolved after analyzing the well-known algorithms such as Boyer-Moore,...

The computation of matchings has applications in the solving process of a large variety of problems, e.g. as part of graph partitioners. We present and analyze three sequential and two parallel approximation algorithms for the cardinality and weighted matching problem. One of the sequential algorithms is based on an algorithm by Karp and Sipser to compute maximal matchings [21]. Another one is ...

An algorithm for searching for a two dimensional m m pattern in a two dimensional n n text is presented. It performs on the average less comparisons than the size of the text: n 2 =m using m 2 extra space. Basically, it uses multiple string matching on only n=m rows of the text. It runs in at most 2n 2 time and is close to the optimal n 2 time for many patterns. It steadily extends to an alphab...

The pattern matching is a well known and important task of the pattern discovery process in today’s world for finding the nucleotide or amino acid sequence patterns in protein sequence databases. Although pattern matching is commonly used in computer science, its applications cover a wide range, including in editors, information retrieval. In this paper we propose a new pattern matching algorit...

The most important features of a string matching algorithm are its eeciency and its exibility. EEciency has traditionally received more attention, while exibility in the search pattern is becoming a more and more important issue. Most classical string matching algorithms are aimed at quickly nding an exact pattern in a text, being Knuth-Morris-Pratt (KMP) and the Boyer-Moore (BM) family the mos...

Twig pattern matching plays a crucial role in xml data processing. Existing twig pattern matching algorithms can be classified into two-phase algorithms and one-phase algorithms. While the two-phase algorithms (e.g., TwigStack) suffer from expensive merging cost, the onephase algorithms (e.g., TwigList, Twig2Stack, HolisticTwigStack) either lack efficient filtering of useless elements, or use o...

We describe and analyze three simple and fast algorithms on the average for solving the problem of string matching with a bounded number of mismatches. These are the naive algorithm, an algorithm based on the Boyer-Moore approach, and ad-hoc deterministic nite automata searching. We include simulation results that compare these algorithms to previous works.

The multi-pattern matching problem consists in finding all occurrences of the patterns from a finite set X in a given text T of length n. We present a new and simple algorithm combining the ideas of the Aho–Corasick algorithm and the directed acyclic word graphs. The algorithm has time complexity which is linear in the worst case (it makes at most 2n symbol comparisons) and has good average-cas...