6251 search results - page 180 / 1251 » Randomness, Computability, and Density |
132
click to vote
SODA
2008
ACM
15 years 5 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...
123
click to vote
AAAI
2004
15 years 5 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...
121
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yu...
124
click to vote
JACM
2007
15 years 3 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...
171
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Consider the minimum mean-square error (MMSE) of estimating an arbitrary random variable from its observation contaminated by Gaussian noise. The MMSE can be regarded as a function...