Sciweavers

33 search results - page 1 / 7
» The complexity of the Weight Problem for permutation groups
Sort
View
DM
2010
82views more  DM 2010»
13 years 11 months ago
The complexity of the weight problem for permutation and matrix groups
Given a metric d on a permutation group G, the corresponding weight problem is to decide whether there exists an element G such that d(, e) = k, for some given value k. Here we ...
Peter J. Cameron, Taoyang Wu
ENDM
2007
64views more  ENDM 2007»
13 years 10 months ago
The complexity of the Weight Problem for permutation groups
Given a metric d on a permutation group G, the corresponding weight problem is to decide whether there exists an element g ∈ G such that d(g, e) = k for some k ∈ N. In this pa...
Peter J. Cameron, Taoyang Wu
ECCC
2011
282views ECommerce» more  ECCC 2011»
13 years 5 months ago
Almost k-wise vs. k-wise independent permutations, and uniformity for general group actions
A family of permutations in Sn is k-wise independent if a uniform permutation chosen from the family maps any distinct k elements to any distinct k elements equally likely. Effici...
Noga Alon, Shachar Lovett
ISBI
2008
IEEE
14 years 11 months ago
Increased sensitivity in FMRI group analysis using mixed-effect modeling
In functional Magnetic Resonance Imaging group studies, uncertainties on the individual BOLD responses are not taken into account by standard detection procedures, which may limit...
Merlin Keller, Alexis Roche
RECOMB
2006
Springer
14 years 11 months ago
Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions
Abstract. During evolution, genomes are subject to genome rearrangements that alter the ordering and orientation of genes on the chromosomes. If a genome consists of a single chrom...
Martin Bader, Enno Ohlebusch