426 search results - page 23 / 86 » Run lengths and liquidity |
COLT
2008
Springer
13 years 11 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...
FCS
2006
2006
Another Algorithm for Computing Longest Common Increasing Subsequence for Two Random Input Sequences
13 years 11 months ago
We have previously developed several algorithms which deal with different input sequence scenarios respectively. In this paper, another sequential algorithm for computing Longest ...
JGAA
2006
13 years 9 months ago
2006
In this paper we present a new characterization of switch-regular upward embeddings, a concept introduced by Di Battista and Liotta in 1998. This characterization allows us to def...
PPL
2000
13 years 9 months ago
2000
In this paper we consider the problem of constructing planar orthogonal grid drawings or more simply, layouts of graphs, with the goal of minimizing the number of bends along the ...
INFOCOM
2003
IEEE
14 years 3 months ago
2003
IEEE
Abstract—The error patterns of a wireless digital communication channel can be described by looking at consecutively correct or erroneous bits (runs and bursts) and at the distri...