Smoothed analysis: an attempt to explain the behavior of algorithms in practice
ACM: Digital Library: Communications of the ACM ACM Digital Library Communications of the
ACM Volume 52, Number 10 (2009), Pages 76-84 Smoothed analysis: an attempt to explain …
ACM Volume 52, Number 10 (2009), Pages 76-84 Smoothed analysis: an attempt to explain …
Smoothed analysis of the k-means method
The k-means method is one of the most widely used clustering algorithms, drawing its
popularity from its speed in practice. Recently, however, it was shown to have exponential …
popularity from its speed in practice. Recently, however, it was shown to have exponential …
Worst-case and smoothed analysis of the ICP algorithm, with an application to the k-means method
D Arthur, S Vassilvitskii - 2006 47th Annual IEEE Symposium …, 2006 - ieeexplore.ieee.org
We show a worst-case lower bound and a smoothed upper bound on the number of
iterations performed by the iterative closest point (ICP) algorithm. First proposed by Besl and …
iterations performed by the iterative closest point (ICP) algorithm. First proposed by Besl and …
The smoothed analysis of algorithms
DA Spielman - … of Computation Theory: 15th International Symposium …, 2005 - Springer
LNCS 3623 - The Smoothed Analysis of Algorithms Page 1 The Smoothed Analysis of Algorithms
Daniel A. Spielman Department of Mathematics, Massachusetts Institute of Technology …
Daniel A. Spielman Department of Mathematics, Massachusetts Institute of Technology …
Typical properties of winners and losers in discrete optimization
R Beier, B Vöcking - Proceedings of the thirty-sixth annual ACM …, 2004 - dl.acm.org
We present a probabilistic analysis for a large class of combinatorial optimization problems
containing, eg, all binary optimization problems defined by linear constraints and a linear …
containing, eg, all binary optimization problems defined by linear constraints and a linear …
K-means has polynomial smoothed complexity
The k-means method is one of the most widely used clustering algorithms, drawing its
popularity from its speed in practice. Recently, however, it was shown to have exponential …
popularity from its speed in practice. Recently, however, it was shown to have exponential …
Real-time scheduling with predictions
The recent revival in learning theory gives us improved capabilities for accurate predictions
and increased opportunities for performance enhancement. This work extends the research …
and increased opportunities for performance enhancement. This work extends the research …
Beyond the worst case: Semi-random complexity analysis of winner determination
The computational complexity of winner determination is a classical and important problem
in computational social choice. Previous work based on worst-case analysis has established …
in computational social choice. Previous work based on worst-case analysis has established …
Smoothed analysis of multi-item auctions with correlated values
Consider a seller with m heterogeneous items for sale to a single additive buyer whose
values for the items are arbitrarily correlated. It was previously shown that, in such settings …
values for the items are arbitrarily correlated. It was previously shown that, in such settings …
[PDF][PDF] Online optimization with lookahead
F Dunke - 2014 - core.ac.uk
Online optimization with lookahead deals with sequential decision making under incomplete
information where each decision must be made on the basis of a limited, but certain preview …
information where each decision must be made on the basis of a limited, but certain preview …