7228 search results - page 199 / 1446 » From Algorithmic to Subjective Randomness |
128
click to vote
CORR
2000
Springer
15 years 3 months ago
2000
Springer
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
141
Voted
CORR
2002
Springer
15 years 3 months ago
2002
Springer
: We study the satisfiability of randomly generated formulas formed by M clauses of exactly K literals over N Boolean variables. For a given value of N the problem is known to be m...
143
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constr...
119
Voted
WWW
2005
ACM
16 years 4 months ago
2005
ACM
To exploit the similarity information hidden in the hyperlink structure of the web, this paper introduces algorithms scalable to graphs with billions of vertices on a distributed ...
148
click to vote
EUROGRAPHICS
2010
Eurographics
15 years 5 months ago
2010
Eurographics
This paper proposes two variants of a simple but efficient algorithm for structure-preserving halftoning. Our algorithm extends Floyd-Steinberg error diffusion; the goal of our ex...