15 search results - page 2 / 3 » jcss 2007 |
JCSS
2007
13 years 4 months ago
2007
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 ā...
JCSS
2007
13 years 4 months ago
2007
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 ...
JCSS
2007
13 years 4 months ago
2007
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...
JCSS
2007
13 years 4 months ago
2007
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 ...
JCSS
2007
13 years 4 months ago
2007
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 ...