We propose Fast Eigen Matching, a method for accelerating the matching and learning processes of the eigenspace method for rotation invariant template matching (RITM). Correlation-based template matching is one of the basic techniques used in computer vision. Among them, rotation invariant template matching (RITM), which locates a known template in a query irrespective of the template’s transla...

computation of the second order delay in rc-tree based circuits is important during the design process of modern vlsi systems with respect to having tree structure circuits. calculation of the second and higher order moments is possible in tree based networks. because of the closed form solution, computation speed and the ease of using the performance optimization in vlsi design methods such as...

Aiming to solve the problems of high memory access and big storage space and long matching time in the regular expression matching of extended finite automaton (XFA), a new regular expression matching algorithm based on high-efficient finite automaton is presented in this paper. The basic idea of the new algorithm is that some extra judging instruments are added at the starting state in order t...

Process model matchers automate the identification of correspondences between process models, i.e., activities that represent similar functionality in different models. This way they support a variety of tasks in business process management, e.g., the management of process model collections, the consolidation of processes, or the re-use of process fragments at design time. To detect corresponde...

-. Service discovery is part of the service-oriented architectural model and supported by any of the realising technologies including Web Services. This paper presents an agent-based system for discovering semantic Web Services whose behaviour is described by OWL-S process model. Rules can be set to constrain service processes, and criteria for considering matching between a service process and...

Typographical data entry errors and incomplete documents, produce imperfect records in real world databases. These errors generate distinct records which belong to the same entity. The aim of Approximate Record Matching is to find multiple records which belong to an entity. In this paper, an algorithm for Approximate Record Matching is proposed that can be adapted automatically with input error...

typographical data entry errors and incomplete documents, produce imperfect records in real world databases. these errors generate distinct records which belong to the same entity. the aim of approximate record matching is to find multiple records which belong to an entity. in this paper, an algorithm for approximate record matching is proposed that can be adapted automatically with input error...

Starting in January 2003, Germany implemented the first two socalled Hartz reforms, followed by the third and fourth packages of Hartz reforms in January 2004 and January 2005, respectively. The aim of these reforms was to accelerate labor market flows and reduce unemployment duration. Without attempting to evaluate the specific components of these Hartz reforms, this paper provides a first att...

Comparing process models and matching similar activities has recently emerged as a research area of business process management. However, the problem is fundamentally hard when considering realistic scenarios: e.g., there is a huge variety of terms and various options for the grammatical structure of activity labels exist. While prior research has established important conceptual foundations, r...