473 search results - page 1 / 95 » Heapable Sequences and Subsequences |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
COMBINATORICS
1998
13 years 5 months ago
1998
It is shown that there are 2n n − n−1 m=0 2n−m−1 2m m permutations which are the union of an increasing sequence and a decreasing sequence. 1991 Mathematics Subject Classi...
ICDE
2009
IEEE
13 years 3 months ago
2009
IEEE
There is a huge wealth of sequence data available, for example, customer purchase histories, program execution traces, DNA, and protein sequences. Analyzing this wealth of data to ...
DATE
2000
IEEE
13 years 9 months ago
2000
IEEE
In [1], Murata et al introduced an elegant representation of block placement called sequence pair. All block placement algorithms which are based on sequence pairs use simulated a...
DCC
2008
IEEE
14 years 5 months ago
2008
IEEE
We present a new construction for sequences in the finite abelian group Cr n without zero-sum subsequences of length n, for odd n. This construction improves the maximal known car...