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

Improved Approximation Bounds for Planar Point Pattern Matching

โœ Scribed by Minkyoung Cho; David M. Mount

Publisher
Springer
Year
2007
Tongue
English
Weight
788 KB
Volume
50
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

Approximate symbolic pattern matching fo
Approximate symbolic pattern matching for protein sequence data
โœ Bill C.H. Chang; Saman K. Halgamuge ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 365 KB

In protein sequences, often two sequences that share similar substrings have similar functional properties. Learning of the characteristics and properties of an unknown protein is much easier if its likely functional properties can be predicted by finding the substrings already known from other prot