Internet security applications of the Munn rings
From MaRDI portal
(Redirected from Publication:5962333)
Recommendations
- Centroid sets with largest weight in Munn semirings for data mining applications
- A Gröbner-Shirshov algorithm for applications in internet security
- Internet security applications of Gröbner-Shirshov bases
- OPTIMAL REES MATRIX CONSTRUCTIONS FOR ANALYSIS OF DATA
- Rees matrix constructions for clustering of data.
Cites work
- scientific article; zbMATH DE number 1944119 (Why is no real title available?)
- scientific article; zbMATH DE number 1944122 (Why is no real title available?)
- scientific article; zbMATH DE number 2031101 (Why is no real title available?)
- scientific article; zbMATH DE number 1505897 (Why is no real title available?)
- scientific article; zbMATH DE number 789816 (Why is no real title available?)
- scientific article; zbMATH DE number 2200689 (Why is no real title available?)
- $\mathcal{D}$-FAITHFUL SEMIGROUP-GRADED RINGS
- A Class of Band-Graded Rings
- A POLYNOMIAL RING CONSTRUCTION FOR THE CLASSIFICATION OF DATA
- A description of incidence rings of group automata.
- A formula for multiple classifiers in data mining based on Brandt semigroups
- A global optimization approach to classification
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- A note on primeness of semigroup rings
- A property of the complex semigroup algebra of a free monoid
- Abelian groups, rings and modules. Proceedings of the AGRAM 2000 conference, Perth, Australia, July 9--15, 2000
- An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings
- Cayley graphs as classifiers for data mining: the influence of asymmetries
- Generators and weights of polynomial codes
- Kasch Modules and pV-Rings
- Nil Ideals in Inverse Semigroup Algebras
- Nil right ideals in inverse semigroup algebras
- On congruences of automata defined by directed graphs
- On transitive Cayley graphs of groups and semigroups
- Optimization methods and the \(k\)-committees algorithm for clustering of sequence data
- Rees matrix constructions for clustering of data.
- Ring constructions and applications
- Rings graded by inverse semigroups
- The Algebra of a Combinatorial Inverse Semigroup
- The Jacobson radical of a band ring
- The radical of the algebra of any finite semigroup over any field
- Trace functions on inverse semigroup algebras
- Undecidable problems for completely 0-simple semigroups.
- Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
- VARIETIES GENERATED BY COMPLETELY 0-SIMPLE SEMIGROUPS
Cited in
(8)- OPTIMAL REES MATRIX CONSTRUCTIONS FOR ANALYSIS OF DATA
- Rees semigroups of digraphs for classification of data.
- Ideal basis in constructions defined by directed graphs
- A Gröbner-Shirshov algorithm for applications in internet security
- Internet security applications of Gröbner-Shirshov bases
- Centroid sets with largest weight in Munn semirings for data mining applications
- Distances of centroid sets in a graph-based construction for information security applications
- On hyperideals in left almost semihypergroups.
This page was built for publication: Internet security applications of the Munn rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5962333)
