207 search results - page 7 / 42 » Run-Time Switching Between Total Order Algorithms |
RECOMB
2010
Springer
13 years 5 months ago
2010
Springer
Chaining fragments is a crucial step in genome alignment. Existing chaining algorithms compute a maximum weighted chain with no overlaps allowed between adjacent fragments. In prac...
SPAA
2004
ACM
14 years 24 days ago
2004
ACM
This paper considers the problem of packet-mode scheduling of input queuedswitches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives t...
COLT
2008
Springer
13 years 9 months ago
2008
Springer
We show how models for prediction with expert advice can be defined concisely and clearly using hidden Markov models (HMMs); standard HMM algorithms can then be used to efficientl...
TMI
2008
13 years 7 months ago
2008
A fast and simple algorithm for designing time-optimal waveforms is presented. The algorithm accepts a given arbitrary multi-dimensional k-space trajectory as the input and outputs...
STOC
2001
ACM
14 years 7 months ago
2001
ACM
Abstract. We consider two types of buffering policies that are used in network switches supporting Quality of Service (QoS). In the FIFO type, packets must be transmitted in the or...