536 search results - page 87 / 108 » Some Lower Bounds for the Complexity of Continuation Methods |
CC
2007
Springer
13 years 8 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
BMCBI
2010
13 years 8 months ago
2010
Background: Finishing is the process of improving the quality and utility of draft genome sequences generated by shotgun sequencing and computational assembly. Finishing can invol...
VLSID
2002
IEEE
14 years 8 months ago
2002
IEEE
Interconnect delay has become a critical factor in determining the performance of integrated circuits. Routing and buffering are powerful means of improving the circuit speed and ...
JMLR
2010
13 years 3 months ago
2010
We consider the problem of correcting the posterior marginal approximations computed by expectation propagation and Laplace approximation in latent Gaussian models and propose cor...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
We propose some slight additions to O-O languages to implement the necessary features for using Deductive Object Programming (DOP). This way of programming based upon the manipula...