Results 11 to 20 of about 461,035 (286)
Smoothed Analysis of Dynamic Networks [PDF]
Distributed Computing, 2015 We generalize the technique of smoothed analysis to distributed algorithms in dynamic network models. Whereas standard smoothed analysis studies the impact of small random perturbations of input values on algorithm performance metrics, dynamic graph ...
A Das Sarma +7 more
core +2 more sources
On smoothed analysis of quicksort and Hoare's find [PDF]
Algorithmica, 2011 We provide a smoothed analysis of Hoare's find algorithm, and we revisit the smoothed analysis of quicksort. Hoare's find algorithm - often called quickselect or one-sided quicksort - is an easy-to-implement algorithm for finding the k-th smallest ...
Fouz, Mahmoud +3 more
core +9 more sources
Smoothed Analysis on Connected Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2013 The main paradigm of smoothed analysis on graphs suggests that for any large graph G in a certain class of graphs, perturbing slightly the edges of G at random (usually adding few random edges to G) typically results in a graph having much "nicer ...
Krivelevich, Michael +2 more
core +8 more sources
Modular smoothed analysis [PDF]
, 2014 Spielman’s smoothed complexity - a hybrid between worst and average case complexity measures - relies on perturbations of input instances to determine where average-case behavior turns to worst-case.
Hennessy, Aoife +2 more
core +2 more sources
Smoothed Analysis with Adaptive Adversaries [PDF]
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), 2022 We prove novel algorithmic guarantees for several online problems in the smoothed analysis model. In this model, at each time step an adversary chooses an input distribution with density function bounded above pointwise by \(\tfrac{1}{\sigma }\) times that of the uniform distribution ...
Nika Haghtalab +2 more
openaire +2 more sources
Smoothed analysis of the low-rank approach for smooth semidefinite programs
CoRR, 2018 We consider semidefinite programs (SDPs) of size n with equality constraints. In order to overcome scalability issues, Burer and Monteiro proposed a factorized approach based on optimizing over a matrix Y of size $n$ by $k$ such that $X = YY^*$ is the ...
Boumal, Nicolas +2 more
core +3 more sources
Adversarial smoothed analysis [PDF]
Journal of Complexity, 2010 The purpose of this note is to extend the results on uniform smoothed analysis of condition numbers from \cite{BuCuLo:07} to the case where the perturbation follows a radially symmetric probability distribution. In particular, we will show that the bounds derived in \cite{BuCuLo:07} still hold in the case of distributions whose density has a ...
Felipe Cucker +2 more
openaire +5 more sources
On the analysis of movement smoothness
Journal of NeuroEngineering and Rehabilitation, 2015 Quantitative measures of smoothness play an important role in the assessment of sensorimotor impairment and motor learning. Traditionally, movement smoothness has been computed mainly for discrete movements, in particular arm, reaching and circle drawing, using kinematic data.
Balasubramanian, Sivakumar +3 more
openaire +8 more sources
Smoothed analysis of balancing networks [PDF]
Random Structures & Algorithms, 2009 AbstractIn a balancing network each processor has an initial collection of unit‐size jobs (tokens) and in each round, pairs of processors connected by balancers split their load as evenly as possible. An excess token (if any) is placed according to some predefined rule. As it turns out, this rule crucially affects the performance of the network.
Tobias Friedrich 0001 +2 more
openaire +5 more sources
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