Sciweavers

8 search results - page 1 / 2
» Stochastic perturbations and smooth condition numbers
Sort
View
JC
2010
95views more  JC 2010»
13 years 2 months ago
Stochastic perturbations and smooth condition numbers
In this paper we dene a new condition number adapted to directionally uniform perturbations in a general framework of maps between Riemannian manifolds. The denitions and theorem...
Diego Armentano
MP
2011
12 years 11 months ago
Smoothed analysis of condition numbers and complexity implications for linear programming
We perform a smoothed analysis of Renegar’s condition number for linear programming by analyzing the distribution of the distance to ill-posedness of a linear program subject to...
John Dunagan, Daniel A. Spielman, Shang-Hua Teng
FOCS
2007
IEEE
13 years 10 months ago
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
Jonathan A. Kelner, Evdokia Nikolova
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
14 years 4 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
DEDS
2010
130views more  DEDS 2010»
13 years 4 months ago
Message Batching in Wireless Sensor Networks - A Perturbation Analysis Approach
Abstract-- We address the problem of batching messages generated at nodes of a sensor network for the purpose of reducing communication energy at the expense of added latency. We f...
Xu Ning, Christos G. Cassandras