5115 search results - page 437 / 1023 » On Randomized Lanczos Algorithms |
197
click to vote
SODA
2008
ACM
15 years 9 months ago
2008
ACM
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a tr...
190
click to vote
SODA
2008
ACM
15 years 9 months ago
2008
ACM
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
189
click to vote
AAAI
2004
15 years 9 months ago
2004
The evaluation of incomplete satisfiability solvers depends critically on the availability of hard satisfiable instances. A plausible source of such instances consists of random k...
153
click to vote
SODA
2003
ACM
15 years 9 months ago
2003
ACM
We introduce the following consensus estimate problem. Several processors hold private and possibly different lower bounds on a value. The processors do not communicate with each ...
175
click to vote
JACM
2007
15 years 7 months ago
2007
This article provides a new conceptual perspective on survey propagation, which is an iterative algorithm recently introduced by the statistical physics community that is very effe...