Dixon's algorithm for the computation of character tables faces two problems—it requires the computation of complete class matrices, and many such class matrices will often turn out to yield no new information. This paper describes a method for overcoming these difficulties. In addition, an algorithm is presented that has a high probability of determining the two characters that span a two-dimensional character space without the need for computing an additional class matrix
Success of optical character recognition depends on a number of factors, two of which are feature ex...
This paper introduces an effective character extraction algorithm that can be used for optical chara...
The absence/presence routine of character coding is examined in regard to minimizing its inherent re...
Dixon's algorithm for the computation of character tables faces two problems—it requires the computa...
A central problem in computational group theory is that of getting the table of ordinary characters ...
AbstractBrauer’s theorem on induced characters is an invitation to an algorithm for computing the ch...
Computational methods for finding the character table of a finite group require a stock of reducible...
Computational methods for finding the character table of a finite group require a stock of reducible...
AbstractThe Murnaghan–Nakayama rule is the classical formula for computing the character table of Sn...
Warren Teitelman presented a novel scheme for real time character recognition in his master's thes...
In spite of the fact that subspace method can approximate the distribution of categories precisely, ...
In this paper we present an algorithm for e ciently counting xed points in a nite monoid M under a c...
AbstractAn algorithm is developed for the computation of the character table of any split metabelian...
The character table of a finite group G is constructed by computing the eigenvectors of matrix equa...
The problem of improving the capability of statistical character classifiers based on finite and spa...
Success of optical character recognition depends on a number of factors, two of which are feature ex...
This paper introduces an effective character extraction algorithm that can be used for optical chara...
The absence/presence routine of character coding is examined in regard to minimizing its inherent re...
Dixon's algorithm for the computation of character tables faces two problems—it requires the computa...
A central problem in computational group theory is that of getting the table of ordinary characters ...
AbstractBrauer’s theorem on induced characters is an invitation to an algorithm for computing the ch...
Computational methods for finding the character table of a finite group require a stock of reducible...
Computational methods for finding the character table of a finite group require a stock of reducible...
AbstractThe Murnaghan–Nakayama rule is the classical formula for computing the character table of Sn...
Warren Teitelman presented a novel scheme for real time character recognition in his master's thes...
In spite of the fact that subspace method can approximate the distribution of categories precisely, ...
In this paper we present an algorithm for e ciently counting xed points in a nite monoid M under a c...
AbstractAn algorithm is developed for the computation of the character table of any split metabelian...
The character table of a finite group G is constructed by computing the eigenvectors of matrix equa...
The problem of improving the capability of statistical character classifiers based on finite and spa...
Success of optical character recognition depends on a number of factors, two of which are feature ex...
This paper introduces an effective character extraction algorithm that can be used for optical chara...
The absence/presence routine of character coding is examined in regard to minimizing its inherent re...
DOI
Add to ORKG