2430 search results - page 318 / 486 » Computing Tutte Polynomials |
147
Voted
RECOMB
2004
Springer
16 years 4 months ago
2004
Springer
The prediction of translation initiation sites (TISs) in eukaryotic mRNAs has been a challenging problem in computational molecular biology. In this paper, we present a new algori...
109
Voted
ICCD
2006
IEEE
16 years 17 days ago
2006
IEEE
Reed-Solomon (RS) codes are among the most widely utilized error-correcting codes in modern communication and computer systems. Among the decoding algorithms of RS codes, the rece...
133
Voted
ISAAC
2009
Springer
15 years 10 months ago
2009
Springer
We study the following question, communicated to us by Mikl´os Ajtai: Can all explicit (e.g., polynomial time computable) functions f : ({0, 1}w )3 → {0, 1}w be computed by word...
133
Voted
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. The synthesis of a reactive system with respect to an ωregular specification requires the solution of a graph game. Such games have been extended in two natural ways. F...
136
Voted
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...