116 search results - page 7 / 24 » Suballowable sequences of permutations |
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
CIKM
2006
Springer
13 years 11 months ago
2006
Springer
The I/O performance of query processing can be improved using two complementary approaches. One can try to improve on the buffer and the file system management policies of the DB ...
COMBINATORICS
2006
13 years 7 months ago
2006
VLSID
2002
IEEE
14 years 8 months ago
2002
IEEE
This paper considers reducing the cost of test application by permuting test vectors to improve their defect coverage. Algorithms for test reordering are developed with the goal o...
RECOMB
2006
Springer
14 years 8 months ago
2006
Springer
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...