Sciweavers

158 search results - page 6 / 32
» Some counting problems related to permutation groups
Sort
View
IPL
2011
96views more  IPL 2011»
14 years 4 months ago
Restricted compositions and permutations: From old to new Gray codes
Any Gray code for a set of combinatorial objects defines a total order relation on this set: x is less than y if and only if y occurs after x in the Gray code list. Let ≺ denot...
Vincent Vajnovszki, Rémi Vernay
JCO
2010
97views more  JCO 2010»
14 years 8 months ago
Subhypergraph counts in extremal and random hypergraphs and the fractional q-independence
We study the extremal parameter N(n, m, H) which is the largest number of copies of a hypergraph H that can be formed of at most n vertices and m edges. Generalizing previous work...
Andrzej Dudek, Joanna Polcyn, Andrzej Rucinski
COCOON
2005
Springer
15 years 3 months ago
Perfect Sorting by Reversals
In computational biology, gene order data is often modelled as signed permutations. A classical problem in genome comparison is to detect conserved segments in a permutation, that ...
Marie-France Sagot, Eric Tannier
ICASSP
2011
IEEE
14 years 1 months ago
Resolving FD-BSS permutation for arbitrary array in presence of spatial aliasing
This paper presents a novel method for solving the permutation problem inherent to frequency domain blind signal separation of multiple simultaneous speakers. As conventional meth...
Jani Even, Norihiro Hagita
ALGOSENSORS
2008
Springer
14 years 11 months ago
Target Counting under Minimal Sensing: Complexity and Approximations
We consider the problem of counting a set of discrete point targets using a network of sensors under a minimalistic model. Each sensor outputs a single integer, the number of disti...
Sorabh Gandhi, Rajesh Kumar 0003, Subhash Suri