Sciweavers

778 search results - page 1 / 156
» Bounding Smooth Integers
Sort
View
ANTS
1998
Springer
107views Algorithms» more  ANTS 1998»
13 years 10 months ago
Bounding Smooth Integers
Daniel J. Bernstein
IPCO
2007
126views Optimization» more  IPCO 2007»
13 years 7 months ago
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
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 ...
René Beier, Heiko Röglin, Berthold V&o...
MP
2007
95views more  MP 2007»
13 years 5 months ago
Smoothed analysis of integer programming
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
Heiko Röglin, Berthold Vöcking
ANTS
2006
Springer
94views Algorithms» more  ANTS 2006»
13 years 9 months ago
Fast Bounds on the Distribution of Smooth Numbers
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...
Scott T. Parsell, Jonathan Sorenson
ICML
2001
IEEE
14 years 6 months ago
Smoothed Bootstrap and Statistical Data Cloning for Classifier Evaluation
This work is concerned with the estimation of a classifier's accuracy. We first review some existing methods for error estimation, focusing on cross-validation and bootstrap,...
Gregory Shakhnarovich, Ran El-Yaniv, Yoram Baram