2095 search results - page 7 / 419 » Describing Groups |
AAECC
2004
Springer
13 years 8 months ago
2004
Springer
Abstract. This article describes two algorithms in order to search decomposition groups of ideals of polynomials with coefficients in a perfect field when those ideals are generate...
SIGOPSE
1990
ACM
14 years 14 days ago
1990
ACM
We propose group communication as an efficient mechanism to support fault tolerance. Our approach is based on an efficient reliable broadcast protocol that requires on average onl...
JSC
2008
13 years 8 months ago
2008
Motivated by the famous 3n + 1 conjecture, we call a mapping from Z to Z residue-class-wise affine if there is a positive integer m such that it is affine on residue classes (mod m...
TSMC
2008
13 years 8 months ago
2008
Abstract-- This paper presents a method that uses gene ontologies, together with the paradigm of relational subgroup discovery, to find compactly described groups of genes differen...
ICDE
2012
IEEE
11 years 11 months ago
2012
IEEE
—Traditional clustering algorithms identify just a single clustering of the data. Today’s complex data, however, allow multiple interpretations leading to several valid groupin...