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.
2016
2016
In this paper, a solution to the problem of Active Authentication using trace histories is addressed. Specifically, the task is… 
2013
2013
Next generation roadway maps and vehicle navigation systems have the objective of reliably achieving where-in-lane positioning… 
Highly Cited
2010
Highly Cited
2010
Several earthquake forecast experiments in Italy have been initiated within the European testing center of the global… 
2009
2009
The aim of this paper is to investigate theoretically as well as experimentally an algebraic multilevel algorithm for the… 
2009
2009
Let A = ((aij)) be an m £ m (m ‚ 3) real random matrix, with independent Gaussian entries with a common variance ae 2 : Denote by… 
2008
2008
For Information Retrieval purposes, there is a need for regularly processing predictably dynamic and potentially huge corpora for… 
1993
1993
The asymptotic covariance matrix of the empirical cepstrum is analyzed. It is shown that for Gaussian processes, ceptral… 
1989
1989
Minimum mean squared error (MMSE) fixed-lag smoothing is used in conjunction with DPCM (differential pulse code modulation) to…