A splitting criterion for pairs of linear transformations
نویسندگان
چکیده
منابع مشابه
A New Criterion for Safe Program Transformations
Previous studies on safety of program transformations with respect to performance considered two criteria: preserving performance within a constant factor and preserving complexity. However, as the requirement of program transformations used in compilers the former seems too restrictive and the latter seems too loose. We propose a new safety criterion: a program transformation preserves perform...
متن کاملA Mean Deviation Based Splitting Criterion for Classification Tree
For the learning of Classification Tree, many researchers have used different splitting criteria, in which most commonly impurity-based criteria are: Gini index, Entropy function and Exponent-based index. By comparing Misclassification rates, none of the splitting criterion can be declared as providing best results in every situation. In this study, a new Mean Deviation based index has been pro...
متن کاملA discriminative splitting criterion for phonetic decision trees
Phonetic decision trees are a key concept in acoustic modeling for large vocabulary continuous speech recognition. Although discriminative training has become a major line of research in speech recognition and all state-of-the-art acoustic models are trained discriminatively, the conventional phonetic decision tree approach still relies on the maximum likelihood principle. In this paper we deve...
متن کاملA Splitting Criterion for Vector Bundles on Higher Dimensional Varieties
We generalize Horrocks’ criterion for the splitting of vector bundles on projective space. We establish an analogous splitting criterion for vector bundles on arbitrary smooth complex projective varieties of dimension ≥ 4, which asserts that a vector bundle E on X splits iff its restriction E|Y to an ample smooth codimension 1 subvariety Y ⊂ X splits.
متن کاملConformational splitting: A more powerful criterion for dead-end elimination
Dead-end elimination (DEE) is a powerful theorem for selecting optimal protein side-chain orientations from a large set of discrete conformations. The present work describes a new approach to dead-end elimination that effectively splits conformational space into partitions to more efficiently eliminate dead-ending rotamers. Split DEE makes it possible to complete protein design calculations tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Illinois Journal of Mathematics
سال: 1978
ISSN: 0019-2082
DOI: 10.1215/ijm/1256048600