Sciweavers

12825 search results - page 8 / 2565
» Improved PLSOM algorithm
Sort
View
125
Voted
AAIM
2007
Springer
145views Algorithms» more  AAIM 2007»
15 years 8 months ago
Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots
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...
Minghui Jiang
126
Voted
FOCS
2008
IEEE
15 years 8 months ago
Constant-Time Approximation Algorithms via Local Improvements
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...
Huy N. Nguyen, Krzysztof Onak
139
Voted
SIAMCOMP
2011
14 years 8 months ago
Self-Improving Algorithms
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...
Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, ...
126
Voted
ARITH
1999
IEEE
15 years 6 months ago
New Algorithms for Improved Transcendental Functions on IA-64
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...
Shane Story, Ping Tak Peter Tang
JCIT
2010
160views more  JCIT 2010»
14 years 8 months ago
An Improved Dynamic Load Balancing Algorithm for a Distributed System in LAN
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...
Jie Huang, Bei Huang, Qiucen Huang