Sciweavers

78 search results - page 2 / 16
» Randomized Methods for Linear Constraints: Convergence Rates...
Sort
View
APPROX
2006
Springer
121views Algorithms» more  APPROX 2006»
13 years 9 months ago
A Randomized Solver for Linear Systems with Exponential Convergence
Abstract. The Kaczmarz method for solving linear systems of equations Ax = b is an iterative algorithm that has found many applications ranging from computer tomography to digital ...
Thomas Strohmer, Roman Vershynin
OL
2011
190views Neural Networks» more  OL 2011»
13 years 21 days ago
On optimality of a polynomial algorithm for random linear multidimensional assignment problem
We demonstrate that the Linear Multidimensional Assignment Problem with iid random costs is polynomially "-approximable almost surely (a. s.) via a simple greedy heuristic, f...
Pavlo A. Krokhmal
MOC
1998
144views more  MOC 1998»
13 years 5 months ago
Convergence of a random walk method for a partial differential equation
Abstract. A Cauchy problem for a one–dimensional diffusion–reaction equation is solved on a grid by a random walk method, in which the diffusion part is solved by random walk...
Weidong Lu
CDC
2010
IEEE
148views Control Systems» more  CDC 2010»
13 years 23 days ago
Convergence rates of consensus algorithms in stochastic networks
Abstract-- We study the convergence rate of average consensus algorithms in networks with stochastic communication failures. We show how the system dynamics can be modeled by a dis...
Stacy Patterson, Bassam Bamieh
JMLR
2008
230views more  JMLR 2008»
13 years 5 months ago
Exponentiated Gradient Algorithms for Conditional Random Fields and Max-Margin Markov Networks
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...
Michael Collins, Amir Globerson, Terry Koo, Xavier...