417 search results - page 13 / 84 » Running Time Predictions for Factoring Algorithms |
RECOMB
2009
Springer
15 years 10 months ago
2009
Springer
Prediction and alignment of RNA pseudoknot structures are NP-hard. Nevertheless, several efficient prediction algorithms by dynamic programming have been proposed for restricted cl...
SDM
2007
SIAM
14 years 11 months ago
2007
SIAM
Consensus clustering has emerged as one of the principal clustering problems in the data mining community. In recent years the theoretical computer science community has generated...
INTERSPEECH
2010
14 years 4 months ago
2010
We describe a new method for pruning in dynamic models based on running an adaptive filtering algorithm online during decoding to predict aspects of the scores in the near future....
54
Voted
ICMCS
2006
IEEE
15 years 3 months ago
2006
IEEE
Given a time horizon parameter h and an object set O, predictive collision detection finds all the object pairs < oi, oj, ti > which will collide in the future time interva...
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
We give a simple formulation of Karr’s algorithm for computing all affine relationships in affine programs. This simplified algorithm runs in time O(nk3 ) where n is the progr...