174 search results - page 28 / 35 » Permutation Groups in NC |
ACISP
1999
Springer
13 years 11 months ago
1999
Springer
We use combinatorial methods and permutation groups to classify homogeneous boolean functions. The property of symmetry of a boolean function limits the size of the function’s cl...
TC
2002
13 years 7 months ago
2002
This article presents simple and highly regular architectures for finite field multipliers using a redundant representation. The basic idea is to embed a finite field into a cyclo...
IJMSO
2010
13 years 6 months ago
2010
: Development and use of ontologies is increasing, but hampered by new challenges, such as determining which ontologies to reuse and which language to use. Ontology development met...
ICDM
2008
IEEE
14 years 1 months ago
2008
IEEE
Association analysis arises in many important applications such as bioinformatics and business intelligence. Given a large collection of measurements over a set of samples, associ...
PADS
2004
ACM
14 years 27 days ago
2004
ACM
We investigated the benefit of exploiting the symmetries of graphs for partitioning. We represent the model to be simulated by a weighted graph. Graph symmetries are studied in th...