We consider the problem of counting the number of lattice vectors of a given length and prove several results regarding its computational complexity. We show that the problem is ā...
Hidden Markov models (HMMs) are often used for biological sequence annotation. Each sequence feature is represented by a collection of states with the same label. In annotating a ...
Automata for unranked trees form a foundation for XML schemas, querying and pattern languages. We study the problem of eļ¬ciently minimizing such automata. First, we study unrank...
The relative worst order ratio, a new measure for the quality of on-line algorithms, was recently deļ¬ned and applied to two bin packing problems. Here, we extend the deļ¬nition ...
In distributed real-time systems, an application is often modeled as a set of real-time transactions, where each transaction is a chain of precedence-constrained tasks. Each task ...