proper mapping 
Geometrical errors are minimized through a proper mapping of the image.


Holomorphic equivalence and proper mapping of bounded Reinhardt domains not containing the origin


IfK andH are closed connected subgroups which intersect only in the neutral element, the multiplicationK ×H √G is shown to be a proper mapping.


To explore the meaning of this time delay and the proper mapping dimension, we applied a fill factor, mutual information, and autocorrelation function algorithm that were generally used to analyze the chaotic characteristics of sampled signals.


We prove that either the proper mapping of a domain of an ndimensional manifold onto a domain of another ndimensional manifold of degree k is an interior mapping or there exists a point in the image that has at least k+2 preimages.


A major disadvantage of this methodology is the problem of finding a proper mapping.


Retrieval algorithms and models must be effective and efficient to allow proper mapping and results.


The results of this lexical comparison can serve as a basis for developing a reference model that allows proper mapping from the different approaches.

