XML filtering solutions developed to date have focused on the matching of documents to large numbers of queries but have not addressed the customization of output needed for emerging distributed information infrastructures. Support for such customization can significantly increase the complexity of the filtering process. In this paper, we show how to leverage an efficient, shared path matching ...

Freeform surfaces are widely used in advanced optical and mechanical devices. In order to assess the form quality of a freeform surface, it is required to match the measurement surface with the design template. To improve the matching efficiency and accuracy, the whole procedure is divided into two stages, rough matching and final fitting. A new rough matching method, called the structured regi...

Feature matching is a prerequisite to a wide variety of vision tasks. This paper presents a method that addresses the problem of matching disparate views of coplanar points and lines in a unified manner. The proposed method employs a randomized search strategy combined with the two-line two-point projective invariant to derive small sets of possibly matching points and lines. These candidate ma...

A nationwide unduplication operation is being considered for the 2010 Census. One potential problem is the possibility of finding large numbers of false positives, especially when matching above the county level. To help evaluate the extent of this problem, the Census Bureau's BigMatch program performed a matching of person records across all Census addresses, using data from the 2000 Census. T...

This paper presents an approach to automated assessment for online training based on approximate graph matching. The algorithm lies at the core of two prototype training systems that we have built in accord with U.S. Army training materials: one for the use of a collaborative visualization and planning tool, the other for rifle maintenance. The algorithm uses approximate graph-matching techniqu...

Feature matching is a prerequisite to a wide variety of vision tasks. This paper presents a method that addresses the problem of matching two views of coplanar points and lines in a unified manner. The views to be matched are assumed to have been acquired from disparate, i.e. very different viewpoints. By employing a randomized search strategy combined with the two-line two-point projective inv...

Archival research is haunted by the question of how complete are archival fonds being consulted. In this article, we describe have used a combination pattern-matching and face-recognition to evaluate completeness Jacques Toussele photographic archive which was established as part Endangered Archives Programme at British Library. A random set scanned prints from matched with originating negative...

The δ-matching problem is a special version of approximate pattern-matching, motivated by applications in musical information retrieval, where the alphabet Σ is an interval of integers. The δ-match is an occurrence of the pattern such that |a − b| ≤ δ for each pair of letters (integers) whose positions match in this occurrence. We investigate relations between δ-matching and pattern-matching wi...

We extend the notion of matching for one-dimensional dynamical systems to random on an interval. prove that a large family piecewise affine interval property implies any invariant density is constant. further introduce one-parameter produce signed binary expansions numbers in [-1,1]. This has Lebesgue almost every parameter. use this frequency digit 0 associated never exceeds 1/2.