291 search results - page 16 / 59 » Approximate centerpoints with proofs |
110
Voted
CASC
2009
Springer
15 years 8 months ago
2009
Springer
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...
110
Voted
ADCM
2007
15 years 1 months ago
2007
Based on radial basis functions approximation, we develop in this paper a new computational algorithm for numerical differentiation. Under an a priori and an a posteriori choice r...
120
Voted
COCO
2009
Springer
15 years 8 months ago
2009
Springer
We prove two main results on how arbitrary linear threshold functions f(x) = sign(w · x − θ) over the n-dimensional Boolean hypercube can be approximated by simple threshold f...
197
Voted
COCO
2011
Springer
14 years 1 months ago
2011
Springer
—In 1997, H˚astad showed NP-hardness of (1 − , 1/q + δ)-approximating Max-3Lin(Zq); however it was not until 2007 that Guruswami and Raghavendra were able to show NP-hardness...
167
Voted
POPL
2012
ACM
13 years 9 months ago
2012
ACM
Differential privacy is a notion of confidentiality that protects the privacy of individuals while allowing useful computations on their private data. Deriving differential priva...