Skip to search formSkip to main contentSkip to account menu

Smoothed analysis

Known as: Smoothed complexity 
Smoothed analysis is a way of measuring the complexity of an algorithm. It gives a more realistic analysis of the practical performance of the… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2020
Highly Cited
2020
We show a hardness result for random smoothing to achieve certified adversarial robustness against attacks in the $\ell_p$ ball… 
Highly Cited
2011
Highly Cited
2011
The k-means method is one of the most widely used clustering algorithms, drawing its popularity from its speed in practice… 
Highly Cited
2011
Highly Cited
2011
In this paper, we mitigate wall EM returns in through-the-wall radar imaging (TWRI) using singular value decomposition (SVD). To… 
Highly Cited
2011
Highly Cited
2011
This paper is devoted to the optimization problem of continuous multi-partitioning, or multi-labeling, which is based on a convex… 
2007
2007
A new prolongator is proposed for smoothed aggregation (SA) multigrid. The proposed prolongator addresses a limitation of… 
Highly Cited
2005
Highly Cited
2005
Substantial effort has been focused over the last two decades on developing multilevel iterative methods capable of solving the… 
Highly Cited
2004
Highly Cited
2004
Substantial effort has been focused over the last two decades on developing multilevel iterative methods capable of solving the… 
Highly Cited
1982
Highly Cited
1982
Conventional spectrum estimates of both the smoothed-periodogram and autoregressive variety lack robustness toward outliers in…