Sciweavers

426 search results - page 43 / 86
» Run lengths and liquidity
Sort
View
CN
2007
110views more  CN 2007»
13 years 10 months ago
Stability of FIFO networks under adversarial models: State of the art
Network stability is an important issue that has attracted the attention of many researchers in recent years. Such interest comes from the need to ensure that, as the system runs ...
Vicent Cholvi, Juan Echagüe
IPL
2008
93views more  IPL 2008»
13 years 10 months ago
Computing Longest Previous Factor in linear time and applications
We give two optimal linear-time algorithms for computing the Longest Previous Factor (LPF) array corresponding to a string w. For any position i in w, LPF[i] gives the length of th...
Maxime Crochemore, Lucian Ilie
IPL
2006
67views more  IPL 2006»
13 years 10 months ago
A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs
The Arc-Preserving Subsequence (APS) problem appears in the comparison of RNA structures in computational biology. Given two arcannotated sequences of length n and m < n, APS a...
Peter Damaschke
DMTCS
2007
49views Mathematics» more  DMTCS 2007»
13 years 10 months ago
Waiting Time Distributions for Pattern Occurrence in a Constrained Sequence
A binary sequence of zeros and ones is called a (d, k)-sequence if it does not contain runs of zeros of length either less than d or greater than k, where d and k are arbitrary, b...
Valery T. Stefanov, Wojciech Szpankowski
TIT
2008
110views more  TIT 2008»
13 years 9 months ago
Optimal Cross-Layer Scheduling of Transmissions Over a Fading Multiaccess Channel
We consider the problem of several users transmitting packets to a base station, and study an optimal scheduling formulation involving three communication layers, namely, the mediu...
Munish Goyal, Anurag Kumar, Vinod Sharma