10988 search results - page 353 / 2198 » Algorithmic Folding Complexity |
139
click to vote
BMCBI
2007
15 years 5 months ago
2007
Background: Accurate identification of novel, functional noncoding (nc) RNA features in genome sequence has proven more difficult than for exons. Current algorithms identify and s...
156
click to vote
PODC
2003
ACM
15 years 10 months ago
2003
ACM
We investigate issues related to the probe complexity of quorum systems and their implementation in a dynamic environment. Our contribution is twofold. The first regards the algo...
132
click to vote
WDAG
1997
Springer
15 years 9 months ago
1997
Springer
Abstract. This work presents new algorithms for the "Do-All" problem that consists of performing t tasks reliably in a message-passing synchronous system of p fault-prone...
114
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We discuss efficient conversion algorithms for orthogonal polynomials. We describe a known conversion algorithm from an arbitrary orthogonal basis to the monomial basis, and deduc...
139
Voted
DCC
2008
IEEE
16 years 4 months ago
2008
IEEE
A probabilistic algorithm is presented for finding a basis of the root space of a linearized polynomial L(x) = t i=0 Lixqi over Fqn . The expected time complexity of the presented ...