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

A fast expected time algorithm for the 2-D point pattern matching problem

โœ Scribed by P.B. Van Wamelen; Z. Li; S.S. Iyengar

Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
379 KB
Volume
37
Category
Article
ISSN
0031-3203

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Rete: A fast algorithm for the many patt
Rete: A fast algorithm for the many pattern/many object pattern match problem
โœ Charles L. Forgy ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 982 KB

The Rete Match Algorithm is an efficient method for comparing a large collection of patterns to a large collection of objects. It finds all the objects that match each pattern. The algorithm was developed for use in production system interpreters, and it has been used for systems containing from a f

A Tree Matching Algorithm and VLSI Archi
A Tree Matching Algorithm and VLSI Architecture for Real-Time 2D Object Classification
โœ M. Schaffer; T. Chen ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 77 KB

## A Tree Matching Algorithm and VLSI Architecture for Real-Time 2D Object Classification his paper presents a real-time classification algorithm for two-dimensional (2D) object contours using a tree model which is implemented in a modular very large scale integration (VLSI) Tar chitecture. The ha

A Crankโ€“Nicholson-based unconditionally
A Crankโ€“Nicholson-based unconditionally stable time-domain algorithm for 2D and 3D problems
โœ Xin Xie; George Pan; Stephen Hall ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 221 KB

## Abstract It has been shown that both ADIโ€FDTD and CNโ€FDTD are unconditionally stable. While the ADI is a secondโ€order approximation, CN is only in the first order. However, analytical expressions reveal that the CNโ€FDTD has much smaller truncation errors and is more accurate than the ADIโ€FDTD. N