Results 1 - 10 of 604

Splitting criterion for reflexive sheaves

by Takuro Abe, Masahiko Yoshinaga
"... The purpose of this paper is to study the structure of reflexive sheaves over projective spaces through hyperplane sections. We give a criterion for a reflexive sheaf to split into a direct sum of line bundles. An application to the theory of free hyperplane arrangements is also given. 0 Main Theore ..."
Abstract - Cited by 8 (2 self) - Add to MetaCart
The purpose of this paper is to study the structure of reflexive sheaves over projective spaces through hyperplane sections. We give a criterion for a reflexive sheaf to split into a direct sum of line bundles. An application to the theory of free hyperplane arrangements is also given. 0 Main

THE SPLITTING CRITERION OF KEMPF AND THE BABYLONIAN TOWER THEOREM

by I. Coandă, G. Trautmann , 2004
"... We show that the idea used by Kempf (1990) in order to obtain a splitting criterion for vector bundles on projective spaces leads to an elementary proof of the Babylonian tower theorem for this class of bundles, a result due to Barth–Van de Ven ..."
Abstract - Cited by 3 (2 self) - Add to MetaCart
We show that the idea used by Kempf (1990) in order to obtain a splitting criterion for vector bundles on projective spaces leads to an elementary proof of the Babylonian tower theorem for this class of bundles, a result due to Barth–Van de Ven

A New Metric Splitting Criterion for Decision Trees

by unknown authors
"... Abstract: We examine a new approach to building decision tree by introducing a geometric splitting criterion, based on the properties of a family of metrics on the space of partitions of a finite set. This criterion can be adapted to the characteristics of the data sets and the needs of the users an ..."
Abstract - Add to MetaCart
Abstract: We examine a new approach to building decision tree by introducing a geometric splitting criterion, based on the properties of a family of metrics on the space of partitions of a finite set. This criterion can be adapted to the characteristics of the data sets and the needs of the users

Z Splitting Criterion for Growing Trees and Boosting

by Harris Drucker , 1999
"... A splitting criterion that arrives out of the context of a new boosting algorithm is used to construct classification trees. Trees constructed using this Z function are compared to those using the entropy function of C4.5 and are found to give much lower error rates. The Z function is also used to c ..."
Abstract - Add to MetaCart
A splitting criterion that arrives out of the context of a new boosting algorithm is used to construct classification trees. Trees constructed using this Z function are compared to those using the entropy function of C4.5 and are found to give much lower error rates. The Z function is also used

A Discriminative Splitting Criterion for Phonetic Decision Trees

by Simon Wiesler, Georg Heigold, Markus Nußbaum-thom, Ralf Schlüter, Hermann Ney
"... 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 phonet ..."
Abstract - Add to MetaCart
phonetic decision tree approach still relies on the maximum likelihood principle. In this paper we develop a splitting criterion based on the minimization of the classification error. An improvement of more than 10 % relative over a discriminatively trained baseline system on the Wall Street Journal corpus

A SPLITTING CRITERION FOR TWO-DIMENSIONAL SEMI-TORI

by Jörg Winkelmann , 2003
"... Abstract. We investigate conditions under which a two-dimensional complex semi-torus splits into a direct product of C ∗ and a onedimensional compact complex torus. A semi-torus is a complex Lie group arising as a quotient of the additive group of a complex vector space V by a discrete subgroup Γ wi ..."
Abstract - Add to MetaCart
Abstract. We investigate conditions under which a two-dimensional complex semi-torus splits into a direct product of C ∗ and a onedimensional compact complex torus. A semi-torus is a complex Lie group arising as a quotient of the additive group of a complex vector space V by a discrete subgroup Γ

A SPLITTING CRITERION FOR RANK 2 VECTOR BUNDLES ON HYPERSURFACES IN P 4

by unknown authors , 1998
"... madonna Abstract. We show that Horrocks ’ criterion for the splitting of rank two vector bundles in P 3 can be extended, with some assumptions on the Chern classes, on non singular hypersurfaces in P 4. Extension of other splitting criterions are studied. ..."
Abstract - Add to MetaCart
madonna Abstract. We show that Horrocks ’ criterion for the splitting of rank two vector bundles in P 3 can be extended, with some assumptions on the Chern classes, on non singular hypersurfaces in P 4. Extension of other splitting criterions are studied.

A SPLITTING CRITERION FOR RANK 2 VECTOR BUNDLES ON HYPERSURFACES IN P 4

by unknown authors , 1998
"... madonna Abstract. We show that Horrocks ’ criterion for the splitting of rank two vector bundles in P 3 can be extended, with some assumptions on the Chern classes, on non singular hypersurfaces in P 4. Extension of other splitting criterions are studied. ..."
Abstract - Add to MetaCart
madonna Abstract. We show that Horrocks ’ criterion for the splitting of rank two vector bundles in P 3 can be extended, with some assumptions on the Chern classes, on non singular hypersurfaces in P 4. Extension of other splitting criterions are studied.

Automatic Selection of Split Criterion during Tree Growing Based on Node Location

by Carla Brodley , 1995
"... Typically, decision tree construction algorithms apply a single "goodness of split" criterion to form each test node of the tree. It is a hypothesis of this research that better results can be obtained if during tree construction one applies a split criterion suited to the "location&q ..."
Abstract - Cited by 24 (1 self) - Add to MetaCart
Typically, decision tree construction algorithms apply a single "goodness of split" criterion to form each test node of the tree. It is a hypothesis of this research that better results can be obtained if during tree construction one applies a split criterion suited to the "

A SPLITTING CRITERION FOR VECTOR BUNDLES ON HIGHER DIMENSIONAL VARIETIES

by Parsa Bakhtary , 2009
"... 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 t ..."
Abstract - Add to MetaCart
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
Results 1 - 10 of 604