47 search results - page 3 / 10 » Some Notes on the Linear Complexity of Sidel'nikov-Lempel-Co... |
BMCBI
2008
13 years 6 months ago
2008
Background: The structure of many eukaryotic cell regulatory proteins is highly modular. They are assembled from globular domains, segments of natively disordered polypeptides and...
ORL
2000
13 years 5 months ago
2000
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
DCC
2004
IEEE
14 years 5 months ago
2004
IEEE
We introduce three new innovations for compression using LDPCs for the Slepian-Wolf problem. The first is a general iterative Slepian-Wolf decoding algorithm that incorporates the...
TON
2012
11 years 8 months ago
2012
—The benefits of using mobile base station to prolong sensor network lifetime have been well recognized. However, due to the complexity of the problem (time-dependent network to...
CIKM
1998
Springer
13 years 10 months ago
1998
Springer
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...