We provide an efficient algorithm for computing the nucleolus for an instance of a weighted cooperative matching game. This resolves a long-standing open question of [Kern and Paulusma, Mathematics of Operations Research, 2003].

Schema matching is a critical problem for integrating heterogeneous information sources. Traditionally, the problem of matching multiple schemas has essentially relied on finding pairwise-attribute correspondence. In contrast, we propose a new matching paradigm, holistic schema matching, to holistically match many schemas at the same time and find all the matchings at once. By handling a set of...

Filtering XML data streams using efficient pattern matching algorithms is a fundamental ability for many datacentric applications and main purpose of the Template Matching sPecification Language (TMPL). In this paper extensions to the language are discussed that enable fomulating more powerful query patterns: The declarative type system, improved predicates, template references and sequence mat...

In the image processing systems, the input image is first preprocessed, which may involve restoration, enhancement or just proper representation of the data. The most significant problem in image analysis is the detection of presence of an object within a given scene or an image. Such a problem occurs in trademarks classification and other areas like remote sensing for monitoring growth pattern...

Searching for a pattern in a text file is a very common operation in many applications ranging from text editor sand databases to applications in molecular biology. In many instances the pattern does not appear in the text exactly. Errors in the text or in the query can result from misspelling or from experimental errors (e.g., when the text is a DNA sequence). The use of such approximate patte...