Sciweavers

APPROX
2006
Springer
109views Algorithms» more  APPROX 2006»
15 years 7 months ago
Dobrushin Conditions and Systematic Scan
We consider Glauber dynamics on finite spin systems. The mixing time of Glauber dynamics can be bounded in terms of the influences of sites on each other. We consider three parame...
Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
138
Voted
CAV
2004
Springer
154views Hardware» more  CAV 2004»
15 years 7 months ago
Automatic Verification of Sequential Consistency for Unbounded Addresses and Data Values
Sequential consistency is the archetypal correctness condition for the memory protocols of shared-memory multiprocessors. Typically, such protocols are parameterized by the number ...
Jesse D. Bingham, Anne Condon, Alan J. Hu, Shaz Qa...
117
Voted
APPROX
2006
Springer
121views Algorithms» more  APPROX 2006»
15 years 7 months ago
Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods
Given an m
Petros Drineas, Michael W. Mahoney, S. Muthukrishn...
APPROX
2006
Springer
100views Algorithms» more  APPROX 2006»
15 years 7 months ago
Robust Local Testability of Tensor Products of LDPC Codes
Given two binary linear codes R and C, their tensor product R C consists of all matrices with rows in R and columns in C. We analyze the "robustness" of the following te...
Irit Dinur, Madhu Sudan, Avi Wigderson
APPROX
2006
Springer
179views Algorithms» more  APPROX 2006»
15 years 7 months ago
Adaptive Sampling and Fast Low-Rank Matrix Approximation
We prove that any real matrix A contains a subset of at most 4k/ + 2k log(k + 1) rows whose span "contains" a matrix of rank at most k with error only (1 + ) times the er...
Amit Deshpande, Santosh Vempala