426 search results - page 35 / 86 » Run lengths and liquidity |
ICALP
2005
Springer
14 years 3 months ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
ISPD
2004
ACM
14 years 3 months ago
2004
ACM
Many current designs contain a large number of standard cells intermixed with larger macro blocks. The range of size in these “mixed block” designs complicates the placement p...
IPPS
2000
IEEE
14 years 2 months ago
2000
IEEE
In this paper, we study the problem of on demand minimum length packet scheduling in single-hop multichannel systems. Examples of these systems are those centered around switching...
CPM
2000
Springer
14 years 2 months ago
2000
Springer
Abstract. We apply the Boyer–Moore technique to compressed pattern matching for text string described in terms of collage system, which is a formal framework that captures variou...
IPPS
1999
IEEE
14 years 2 months ago
1999
IEEE
We present practical parallel algorithms using prefix computations for various problems that arise in pairwise comparison of biological sequences. We consider both constant and af...