The “stable marriage” problem is often described as follows. There are n men and n women; each of the men has an order of preference on the women, and each of the women has an order of preference on the men. A “matching” of the people into n man-woman pairs is said to be unstable if there exist some man and some woman who both prefer each other to their partner in the matching. If there is no s...

Process model matching techniques aim at automatically identifying activity correspondences between two process models that represent the same or similar behavior. By doing so, they provide essential input for many advanced process model analysis techniques such as process model search. Despite their importance, the performance of process model matching techniques is not yet convincing and seve...

Matching natural language sentences is central for many applications such as information retrieval and question answering. Existing deep models rely on a single sentence representation or multiple granularity representations for matching. However, such methods cannot well capture the contextualized local information in the matching process. To tackle this problem, we present a new deep architec...

The queries to a practical Question Answering (QA) system range from keywords, phrases, badly written questions, and occasionally grammatically perfect questions. Among different kinds of question analysis approaches, the pattern matching works well in analyzing such queries. It is costly to build this pattern matching module because tremendous manual labor is needed to expand its coverage to s...

The notion of removable classes arises in connection with ear decompositions of matching covered graphs introduced by Lovász and Plummer. The last (single or double) ear of an ear decomposition is defined as a removable class. Every matching covered graph not induced by a circuit has at least three removable classes. In this paper, we characterize matching covered graphs with precisely three re...

We resolve an open question by determining matching (asymptotic) upper and lower bounds on the state complexity of the operation that sends a language L to (

This paper addresses the problem of systematically building a matching algorithm for the union of two disjoint equational theories. The question is under which conditions matching algorithms in the single theories are suucient to obtain a matching algorithm in the combination? In general, the blind use of combination techniques introduces uniication. Two diierent restrictions are considered in ...

the most important factor in donor-recipient matching for hematopoietic stem cell transplantation is their hla typing. for many patients, we can not find a full-matched donor. in high risk patients, one locus  mismatched related donors are suitable alternatives. (1, 2) since the matching of patients and their siblings usually is based on low resolution hla typing, the matching of one locus mism...

Modern Question/Answering systems rely on expected answer types for processing questions. The answer type is a semantic category provided by Named Entity recognizer or by semantic hierarchies. We argue in this paper that Q/A systems should take advantage of the topic information by exploiting several models of question and answer categorization. The matching of the question category with the an...