54 search results - page 1 / 11 » Fast Bounds on the Distribution of Smooth Numbers |
ANTS
2006
Springer
13 years 8 months ago
2006
Springer
Let P(n) denote the largest prime divisor of n, and let (x, y) be the number of integers n x with P(n) y. In this paper we present improvements to Bernstein's algorithm, whi...
IPCO
2007
13 years 6 months ago
2007
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
MP
2011
12 years 11 months ago
2011
We perform a smoothed analysis of Renegar’s condition number for linear programming by analyzing the distribution of the distance to ill-posedness of a linear program subject to...
CDC
2010
IEEE
12 years 12 months ago
2010
IEEE
We derive lower bounds on the convergence speed of a widely used class of distributed averaging algorithms. In particular, we prove that any distributed averaging algorithm whose ...
JMLR
2002
13 years 4 months ago
2002
We construct a framework which allows an algorithm to turn the distributions produced by some boosting algorithms into polynomially smooth distributions (w.r.t. the PAC oracle...