✦ LIBER ✦

One-dimensional approximate point set pattern matching with -norm

✍ Scribed by Wang, Hung-Lung; Chen, Kuan-Yu

Book ID: 122208696
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 275 KB
Volume: 521
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.11.022

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

Approximate minimum weight matching on p

Approximate minimum weight matching on points ink-dimensional space

✍ Pravin M. Vaidya 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 842 KB

The uniform approximation of functions o

The uniform approximation of functions on closed sets with angular points

✍ P. E. Antonyuk 📂 Article 📅 1978 🏛 Springer 🌐 English ⚖ 365 KB

On 3-D Point Set Matching With MAE and S

On 3-D Point Set Matching With MAE and SAE Cost Criteria

✍ Calafiore, G.C. 📂 Article 📅 2008 🏛 IEEE 🌐 English ⚖ 457 KB

On the structure of the set of equivalen

On the structure of the set of equivalent norms on with the fixed point property

✍ Carlos A. Hernández Linares; María A. Japón; Enrique Llorens-Fuster 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 180 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