2766 search results - page 441 / 554 » Algorithms for trigonometric polynomials |
147
click to vote
COCO
2005
Springer
15 years 9 months ago
2005
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 ...
173
click to vote
WADS
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
188
click to vote
STOC
2000
ACM
15 years 8 months ago
2000
ACM
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
119
click to vote
ALT
1999
Springer
15 years 8 months ago
1999
Springer
We introduce a new model for learning in the presence of noise, which we call the Nasty Noise model. This model generalizes previously considered models of learning with noise. Th...
133
click to vote
CGO
2003
IEEE
15 years 7 months ago
2003
IEEE
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...