✦ LIBER ✦

On matching the SSpj AND GNpj algorithms

✍ Scribed by Wood, W. L.

Publisher: Wiley (John Wiley & Sons)
Year: 1986
Tongue: English
Weight: 197 KB
Volume: 2
Category: Article
ISSN: 0748-8025
DOI: 10.1002/cnm.1630020504

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Further results on the accuracy of the S

Further results on the accuracy of the SSpj algorithms

✍ Wood, W. L. 📂 Article 📅 1987 🏛 Wiley (John Wiley & Sons) 🌐 English ⚖ 315 KB

Multi-Dimensional Pattern Matching with

Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms

✍ Raffaele Giancarlo; Roberto Grossi 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 434 KB

We introduce a new multidimensional pattern matching problem that is a Ž natural generalization of string matching, a well studied problem A. V. Aho, Ž . ''Handbook of Theoretical Computer Science'' J. van Leeuwen, Ed. , pp. 257᎐295, . Elsevier, Amsterdam, 1990 . The motivation for its algorithmic s

Assessing the performance of matching al

Assessing the performance of matching algorithms when selection into treatment is strong

✍ Boris Augurzky; Jochen Kluve 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 190 KB

## Abstract This paper investigates the method of matching regarding two crucial implementation choices: the distance measure and the type of algorithm. We implement optimal full matching—a fully efficient algorithm—and present a framework for statistical inference. The implementation uses data fro

Note on the path-matching formula

✍ András Frank; László Szegő 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB

## Abstract As a common generalization of matchings and matroid intersections, W.H. Cunningham and J.F. Geelen introduced the notion of path‐matchings. They proved a min‐max formula for the maximum value. Here, we exhibit a simplified version of their min‐max theorem and provide a purely combinator

On the theory of the matching polynomial

✍ C. D. Godsil; I. Gutman 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 325 KB 👁 1 views

## Abstract In this paper we report on the properties of the matching polynomial α(__G__) of a graph __G__. We present a number of recursion formulas for α(__G__), from which it follows that many families of orthogonal polynomials arise as matching polynomials of suitable families of graphs. We con

Block-matching algorithm based on an ada

Block-matching algorithm based on an adaptive reduction of the search area for motion estimation

✍ Hwang-Seok Oh; Heung-Kyu Lee 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 300 KB

Block-matching algorithm based on an adaptive reduction of the search area for motion estimation T he motion estimation and compensation technique is widely used for video coding applications but the real-time motion estimation is not easy due to its enormous computations. In this paper, a new adapt