1806 search results - page 33 / 362 » Randomness and halting probabilities |
RSA
2008
14 years 11 months ago
2008
Let I be a random 3CNF formula generated by choosing a truth assignment for variables x1, . . . , xn uniformly at random and including every clause with i literals set true by w...
104
click to vote
COMBINATORICA
2008
14 years 12 months ago
2008
A random geometric graph Gn is constructed by taking vertices X1, . . . , Xn Rd at random (i.i.d. according to some probability distribution with a bounded density function) and...
116
click to vote
ECCV
1994
Springer
15 years 3 months ago
1994
Springer
A variety of computer vision problems can be optimally posed as Bayesian labeling in which the solution of a problem is dened as the maximum a posteriori (MAP) probability estimate...
APPROX
2005
Springer
15 years 5 months ago
2005
Springer
Abstract: We study the average-case learnability of DNF formulas in the model of learning from uniformly distributed random examples. We define a natural model of random monotone ...
VOSS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Randomization is of paramount importance in practical applications and randomized algorithms are used widely, for example in co-ordinating distributed computer networks, ...