Hierarchical Matching Beats

نویسنده

  • Robert B. Fisher
چکیده

In Fisherr1] we introduced a non-wildcard model matching algorithm that has speed advantages over the standard Interpretation Tree model matching algorithm. This paper describes a hierarchical model-matching algorithm that has improved performance over both the standard and non-wildcard algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hierarchical Matching Beats The Non-Wildcard and Interpretation Tree Model Matching Algorithms

In Fisher[l] we introduced a non-wildcard model matching algorithm that has speed advantages over the standard Interpretation Tree model matching algorithm. This paper describes a hierarchical model-matching algorithm that has improved performance over both the standard and non-wildcard algorithms.

متن کامل

An Improved Semantic Schema Matching Approach

Schema matching is a critical step in many applications, such as data warehouse loading, Online Analytical Process (OLAP), Data mining, semantic web [2] and schema integration. This task is defined for finding the semantic correspondences between elements of two schemas. Recently, schema matching has found considerable interest in both research and practice. In this paper, we present a new impr...

متن کامل

Induced Pluripotent Stem Cell–Derived Cardiomyocytes Provide In Vivo Biological Pacemaker Function

BACKGROUND Although multiple approaches have been used to create biological pacemakers in animal models, induced pluripotent stem cell-derived cardiomyocytes (iPSC-CMs) have not been investigated for this purpose. We now report pacemaker function of iPSC-CMs in a canine model. METHODS AND RESULTS Embryoid bodies were derived from human keratinocytes, their action potential characteristics det...

متن کامل

Internal-to-internal transition method for consecutive hierarchical template matching

This study proposes a method reducing the tree traversal cost by first investigating the most probable node instead of the root node when a hierarchical template matching is consecutively applied to the object. In particular, this study gives a novel viewpoint that a consecutive hierarchical template matching could be regarded as a transition of a hierarchical finite state machine, and then it ...

متن کامل

Musical Rhythm: A Formal Model for Determining Local Boundaries, Accents and Metre in a Melodic Surface

In this paper a general theory will be introduced that allows the description of a melodic surface i.e. a score-like representation of a melody in terms of local grouping, accentuation and metrical structures. Firstly, a formal model will be proposed that detects points of maximum local change that allow a listener to identify local perceptual boundaries in a melodic surface. The Local Botmdary...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011