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

A modified metric to compute distance

โœ Scribed by D. Chaudhuri; C.A. Murthy; B.B. Chaudhuri

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
660 KB
Volume
25
Category
Article
ISSN
0031-3203

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Recognizing Hand-Printed Digits with a D
Recognizing Hand-Printed Digits with a Distance Quasi-Metric
โœ Thomas E. Portegys ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 94 KB

A distance quasi-metric for pattern recognition is presented. The "quasi" modifier distinguishes the metric from "true" distance metrics which obey a set of standard constraints. By relaxing one of the constraints and coupling it with a fast multidimensional search technique, the metric demonstrates

A Remark on Computing Distance Functions
A Remark on Computing Distance Functions
โœ Giovanni Russo; Peter Smereka ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 142 KB

We propose a new method for the reconstruction of the signed distance function in the context of level set methods. The new method is a modification of the algorithm which makes use of the PDE equation for the distance function introduced by M. Sussman, P. Smereka, and S. Osher (1994, J. Comput. Phy

A RECURSIVE APPROACH TO COMPUTE NORMAL F
A RECURSIVE APPROACH TO COMPUTE NORMAL FORMS
โœ L. HSU; L.J. MIN; L. FAVRETTO ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 388 KB

Normal forms are instrumental in the analysis of dynamical systems described by ordinary di!erential equations, particularly when singularities close to a bifurcation are to be characterized. However, the computation of a normal form up to an arbitrary order is numerically hard. This paper focuses o