116 search results - page 13 / 24 » Suballowable sequences of permutations |
RECOMB
2010
Springer
13 years 6 months ago
2010
Springer
Motivated by the trend of genome sequencing without completing the sequence of the whole genomes, Mu˜noz et al. recently studied the problem of filling an incomplete multichromos...
ICPP
1992
IEEE
13 years 11 months ago
1992
IEEE
Many routing problems in parallel processing, such as concentration and permutation problems, can be cast as sorting problems. In this paper, we consider the problem of sorting on ...
INFORMATICALT
2008
13 years 7 months ago
2008
Abstract. This paper presents a novel robust digital image watermarking scheme using subsampling and nonnegative matrix factorization. Firstly, subsampling is used to construct a s...
JCSS
2008
13 years 7 months ago
2008
We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f( ) = for all 0, where is the...
WSC
1998
13 years 9 months ago
1998
The regenerative method of simulation output analysis exploits the regenerative structure of a stochastic process to break up a path into independent and identically distributed c...