✦ LIBER ✦

Approximate input sensitive algorithms for point pattern matching

✍ Scribed by Dror Aiger; Klara Kedem

Book ID: 108234555
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 486 KB
Volume: 43
Category: Article
ISSN: 0031-3203
DOI: 10.1016/j.patcog.2009.05.014

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximate one-to-one point pattern mat

Approximate one-to-one point pattern matching

✍ Benkert, Marc; Gudmundsson, Joachim; Merrick, Damian; Wolle, Thomas 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 497 KB

Combinatorial and Experimental Methods f

Combinatorial and Experimental Methods for Approximate Point Pattern Matching

✍ Martin Gavrilov; Piotr Indyk; Rajeev Motwani; Suresh Venkatasubramanian 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 688 KB

Analysis of two-dimensional approximate

Analysis of two-dimensional approximate pattern matching algorithms

✍ Park Kunsoo 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 717 KB

We present a new and more rigorous analysis of the two algorithms for two-dimensional approximate pattern matching due to KtikkEnen and Ukkonen. We also present modifications of these algorithms that use less space while keeping the same expected time.

Algorithms for approximate string matchi

Algorithms for approximate string matching

✍ Esko Ukkonen 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 867 KB

Improving an Algorithm for Approximate P

Improving an Algorithm for Approximate Pattern Matching

✍ G. Navarro; R. Baeza-Yates 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 446 KB

A point pattern matching algorithm

✍ Shinji Umeyama 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 798 KB