We consider linear codes associated to Schubert varieties in Grassmannians. A formula for the minimum distance of these codes was conjectured in 2000 and after having been established in various special cases, it was proved in 2008 by Xiang. We give an alternative proof of this formula. Further, we propose a characterization of the minimum weight codewords of Schubert codes by introducing the n...

Support Vector Data Description (SVDD) as a one-class classifier was developed to construct the minimum hypersphere that encloses all the data of the target class in a high dimensional feature space. However, SVDD treats the features of all data equivalently in constructing the minimum hypersphere since it adopts Euclidean distance metric and lacks the incorporation of prior knowledge. In this ...

In this paper a fast and novel method is proposed for multi-font multi-size Kannada numeral recognition which is thinning free and without size normalization approach. The different structural feature are used for numeral recognition namely, directional density of pixels in four directions, water reservoirs, maximum profile distances, and fill hole density are used for the recognition of Kannad...