1806 search results - page 123 / 362 » Randomness and halting probabilities |
112
Voted
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
Given a connected graph G and a failure probability pe for each edge e in G, the reliability of G is the probability that G remains connected when each edge e is removed independe...
144
Voted
STOC
2003
ACM
16 years 3 months ago
2003
ACM
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
147
Voted
AIPS
2009
15 years 4 months ago
2009
We define the robustness of a sequential plan as the probability that it will execute successfully despite uncertainty in the execution environment. We consider a rich notion of u...
141
Voted
ICML
2010
IEEE
15 years 4 months ago
2010
IEEE
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
112
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
This paper introduces a simple and very general theory of compressive sensing. In this theory, the sensing mechanism simply selects sensing vectors independently at random from a ...