๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Pattern Matching for Sets of Segments

โœ Scribed by Alon Efrat; Piotr Indyk; Suresh Venkatasubramanian

Publisher
Springer
Year
2004
Tongue
English
Weight
325 KB
Volume
40
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Pattern matching for permutations
Pattern matching for permutations
โœ Prosenjit Bose; Jonathan F. Buss; Anna Lubiw ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 638 KB

## Given a permutation T of 1 to n, and a permutation P of 1 to k, for k < n, we wish to find a k-element subsequence of T whose elements are ordered according to the permutation P. For example, if P is ( 1,2, . . . , k), then we wish to find an increasing subsequence of length k in T; this specia

Spectral correspondence for point patter
Spectral correspondence for point pattern matching
โœ Marco Carcassoni; Edwin R. Hancock ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 596 KB

This paper investigates the correspondence matching of point-sets using spectral graph analysis. In particular, we are interested in the problem of how the modal analysis of point-sets can be rendered robust to contamination and drop-out. We make three contributions. First, we show how the modal str