12825 search results - page 8 / 2565 » Improved PLSOM algorithm |
173
Voted
AAIM
2007
Springer
2007
Springer
Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots
16 years 3 hour ago
We study three closely related problems motivated by the prediction of RNA secondary structures with arbitrary pseudoknots: the MAXIMUM BASE PAIR STACKINGS problem proposed by Ieon...
180
Voted
FOCS
2008
IEEE
16 years 8 days ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
191
click to vote
SIAMCOMP
2011
15 years 23 days ago
2011
We investigate ways in which an algorithm can improve its expected performance by fine-tuning itself automatically with respect to an arbitrary, unknown input distribution. We gi...
174
click to vote
ARITH
1999
IEEE
15 years 10 months ago
1999
IEEE
The IA-64 architecture provides new opportunities and challenges for implementing an improved set of transcendental functions. Using several novel polynomial-based table-driven te...
174
click to vote
JCIT
2010
15 years 18 days ago
2010
A dynamic time delay model for load balancing was proposed in distributed heterogeneous system by Hayat. But how to compute the load-transfer delay and the gain coefficient were n...