Results 21 to 30 of about 138,082 (310)
Smoothed Analysis of the Komlós Conjecture
CoRR, 2022 The well-known Komlós conjecture states that given $n$ vectors in $\mathbb{R}^d$ with Euclidean norm at most one, there always exists a $\pm 1$ coloring such that the $\ell_{\infty}$ norm of the signed-sum vector is a constant independent of $n$ and $d$. We prove this conjecture in a smoothed analysis setting where the vectors are perturbed by adding a
Bansal, Nikhil +4 more
openaire +4 more sources
Smooth discrimination analysis
The Annals of Statistics, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mammen, Enno, Tsybakov, Alexandre B.
openaire +5 more sources
Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method [PDF]
TheoretiCSThe simplex method for linear programming is known to be highly efficient in practice, and understanding its performance from a theoretical perspective is an active research topic. The framework of smoothed analysis, first introduced by Spielman and Teng
Sophie Huiberts +2 more
doaj +1 more source
The Smoothed Analysis of Algorithms
, 2005 Spielman and Teng introduced the smoothed analysis of algorithms to provide a framework in which one could explain the success in practice of algorithms and heuristics that could not be understood through the traditional worst-case and average-case analyses. In this talk, we survey some of the smoothed analyses that have been performed.
Spielman, Daniel A., Teng, Shang-Hua
openaire +3 more sources
Smoothed Analysis of the Simplex Method [PDF]
, 2020 In this chapter, we give a technical overview of smoothed analyses of the shadow vertex simplex method for linear programming (LP). We first review the properties of the shadow vertex simplex method and its associated geometry. We begin the smoothed analysis discussion with an analysis of the successive shortest path algorithm for the minimum-cost ...
D.N. Dadush (Daniel) +1 more
openaire +2 more sources
Smoothed analysis of probabilistic roadmaps
Computational Geometry, 2007 The probabilistic roadmap algorithm that revolutionized robot planning is a simple heuristic that exhibits rapid performance with unbounded worst-case running time as a function of the input's combinatorial complexity. This paper initiates the use of smoothed analysis to explain the success of the probabilistic roadmap algorithm.
Siddhartha Chaudhuri, Vladlen Koltun
openaire +1 more source
Cancer incidence in men: a cluster analysis of spatial patterns
BMC Cancer, 2008 Background Spatial clustering of different diseases has received much less attention than single disease mapping. Besides chance or artifact, clustering of different cancers in a given area may depend on exposure to a shared risk factor or to multiple ...
D'Alò Daniela +4 more
doaj +1 more source
A foreground extraction model on image multiscale decomposition
四川大学学报. 自然科学版, 2021 In order to make up for the negative impact of texture on the extraction results of the traditional GrabCut model, this paper analyzes the scale characteristics of the image edge and color distribution, and combines the image multiscale decomposition and
WANG Bin, HE Kun, WangDan
doaj
Modelling stunting in LiST: the effect of applying smoothing to linear growth data
BMC Public Health, 2017 Background The Lives Saved Tool (LiST) is a widely used resource for evidence-based decision-making regarding health program scale-up in low- and middle-income countries.
Simon Cousens +16 more
doaj +1 more source
Applied Sciences, 2021 Seismicity-based earthquake forecasting models have been primarily studied and developed over the past twenty years. These models mainly rely on seismicity catalogs as their data source and provide forecasts in time, space, and magnitude in a ...
Matteo Taroni, Aybige Akinci
doaj +1 more source