Sciweavers

291 search results - page 16 / 59
» Approximate centerpoints with proofs
Sort
View
CASC
2009
Springer
157views Mathematics» more  CASC 2009»
14 years 5 months ago
On the Complexity of Reliable Root Approximation
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...
Michael Kerber
ADCM
2007
155views more  ADCM 2007»
13 years 10 months ago
Numerical differentiation by radial basis functions approximation
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...
T. Wei, Y. C. Hon
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
14 years 5 months ago
Improved Approximation of Linear Threshold Functions
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...
Ilias Diakonikolas, Rocco A. Servedio
COCO
2011
Springer
261views Algorithms» more  COCO 2011»
12 years 10 months ago
Hardness of Max-2Lin and Max-3Lin over Integers, Reals, and Large Cyclic Groups
—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...
Ryan O'Donnell, Yi Wu, Yuan Zhou
POPL
2012
ACM
12 years 6 months ago
Probabilistic relational reasoning for differential privacy
Differential privacy is a notion of confidentiality that protects the privacy of individuals while allowing useful computations on their private data. Deriving differential priva...
Gilles Barthe, Boris Köpf, Federico Olmedo, S...