Results 231 to 240 of about 44,631 (264)
Some of the next articles are maybe not open access.
Order, 2010
A skew lattice is an algebra \((L;\vee, \wedge)\) of type \((2,2)\) such that both operations are associative, idempotent and satisfy the absorbtion identities \(x\wedge(x\vee y)=x=(y\vee x)\wedge x\) and \(x\vee(x\wedge y)=x=(y\wedge x)\vee x\). Clearly, a lattice is a skew lattice. A skew lattice is called left cancellative whenever \(x\vee y=x\vee z\
Karin Cvetko-Vah +3 more
openaire +3 more sources
A skew lattice is an algebra \((L;\vee, \wedge)\) of type \((2,2)\) such that both operations are associative, idempotent and satisfy the absorbtion identities \(x\wedge(x\vee y)=x=(y\vee x)\wedge x\) and \(x\vee(x\wedge y)=x=(y\wedge x)\vee x\). Clearly, a lattice is a skew lattice. A skew lattice is called left cancellative whenever \(x\vee y=x\vee z\
Karin Cvetko-Vah +3 more
openaire +3 more sources
Skewness in Commingled Distributions
Biometrics, 1976A likelihood ratio test is given for distinguishing skewness from commingled distributions, using a power transform to remove skewness appropriately for each of the alternatives tested. The alternative hypotheses postulate that the transformed data are from one normal or a mixture of two or three normal homoscedastic distributions.
Maclean, C. J. +3 more
openaire +2 more sources
1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers, 2002
An exact zero skew clock routing algorithm using the Elmore delay model is presented. Recursively in a bottom-up fashion, two zero-skewed subtrees are merged into a new tree with zero skew. The algorithm can be applied to single-staged clock trees, multi-staged clock trees, and multi-chip system clock trees.
openaire +1 more source
An exact zero skew clock routing algorithm using the Elmore delay model is presented. Recursively in a bottom-up fashion, two zero-skewed subtrees are merged into a new tree with zero skew. The algorithm can be applied to single-staged clock trees, multi-staged clock trees, and multi-chip system clock trees.
openaire +1 more source
Proceedings., 11th IAPR International Conference on Pattern Recognition. Vol. IV. Conference D: Architectures for Vision and Pattern Recognition,, 2003
Many surfaces of objects are bounded by planar bilaterally symmetric figures. When these figures are imaged under orthographic projection a skewed symmetric contour results. In this paper a new, fast local method to recover skewed symmetries from curve segments is proposed. It can be applied to complete as well as to occluded contours. Furthermore, the
openaire +2 more sources
Many surfaces of objects are bounded by planar bilaterally symmetric figures. When these figures are imaged under orthographic projection a skewed symmetric contour results. In this paper a new, fast local method to recover skewed symmetries from curve segments is proposed. It can be applied to complete as well as to occluded contours. Furthermore, the
openaire +2 more sources