Sciweavers

207 search results - page 14 / 42
» The Polynomial Method for Random Matrices
Sort
View
JMLR
2010
115views more  JMLR 2010»
13 years 3 months ago
Polynomial-Time Exact Inference in NP-Hard Binary MRFs via Reweighted Perfect Matching
We develop a new form of reweighting (Wainwright et al., 2005b) to leverage the relationship between Ising spin glasses and perfect matchings into a novel technique for the exact ...
Nic Schraudolph
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 8 months ago
Estimation with Random Linear Mixing, Belief Propagation and Compressed Sensing
Abstract--We apply Guo and Wang's relaxed belief propagation (BP) method to the estimation of a random vector from linear measurements followed by a componentwise probabilisti...
Sundeep Rangan
CAV
2009
Springer
132views Hardware» more  CAV 2009»
14 years 9 months ago
Image Computation for Polynomial Dynamical Systems Using the Bernstein Expansion
This paper is concerned with the problem of computing the image of a set by a polynomial function. Such image computations constitute a crucial component in typical tools for set-b...
Thao Dang, David Salinas
STOC
2009
ACM
143views Algorithms» more  STOC 2009»
14 years 9 months ago
Affine dispersers from subspace polynomials
An affine disperser over Fn 2 for sources of dimension d is a function f : Fn 2 F2 such that for any affine space S Fn 2 of dimension at least d, we have {f(s) : s S} = F2. Aff...
Eli Ben-Sasson, Swastik Kopparty
STOC
2006
ACM
83views Algorithms» more  STOC 2006»
14 years 8 months ago
A randomized polynomial-time simplex algorithm for linear programming
We present the first randomized polynomial-time simplex algorithm for linear programming. Like the other known polynomial-time algorithms for linear programming, its running time ...
Jonathan A. Kelner, Daniel A. Spielman