Sciweavers

2414 search results - page 7 / 483
» Computing Normal Subgroups
Sort
View
ECCC
2006
99views more  ECCC 2006»
13 years 7 months ago
On the Subgroup Distance Problem
We investigate the computational complexity of finding an element of a permutation group H Sn with a minimal distance to a given Sn, for different metrics on Sn. We assume that...
Christoph Buchheim, Peter J. Cameron, Taoyang Wu
BMCBI
2010
108views more  BMCBI 2010»
13 years 7 months ago
Comparison of scores for bimodality of gene expression distributions and genome-wide evaluation of the prognostic relevance of h
Background: A major goal of the analysis of high-dimensional RNA expression data from tumor tissue is to identify prognostic signatures for discriminating patient subgroups. For t...
Birte Hellwig, Jan G. Hengstler, Marcus Schmidt, M...
ICDCS
2002
IEEE
14 years 13 days ago
Key Trees and the Security of Interval Multicast
A key tree is a distributed data structure of security keys that can be used by a group of users. In this paper, we describe how any user in the group can use the different keys i...
Mohamed G. Gouda, Chin-Tser Huang, E. N. Elnozahy
SODA
2003
ACM
100views Algorithms» more  SODA 2003»
13 years 8 months ago
Quantum algorithms for some hidden shift problems
Almost all of the most successful quantum algorithms discovered to date exploit the ability of the Fourier transform to recover subgroup structure of functions, especially periodi...
Wim van Dam, Sean Hallgren, Lawrence Ip
CAINE
2003
13 years 8 months ago
A Genetic Algorithm for Clustering on Very Large Data Sets
Clustering is the process of subdividing an input data set into a desired number of subgroups so that members of the same subgroup are similar and members of different subgroups h...
Jim Gasvoda, Qin Ding