1806 search results - page 222 / 362 » Randomness and halting probabilities |
105
click to vote
WSC
2008
15 years 6 months ago
2008
This paper develops procedures for selecting a set of normal populations with unknown means and unknown variances in order that the final subset of selected populations satisfies ...
130
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
A (q, , )-locally decodable code (LDC) C : {0, 1}n {0, 1}m is an encoding from n-bit strings to m-bit strings such that each bit xk can be recovered with probability at least 1 2 +...
145
click to vote
PODS
2010
ACM
15 years 6 months ago
2010
ACM
We study highly expressive query languages such as datalog, fixpoint, and while-languages on probabilistic databases. We generalize these languages such that computation steps (e....
127
click to vote
ASUNAM
2010
IEEE
15 years 6 months ago
2010
IEEE
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
133
click to vote
NIPS
2008
15 years 5 months ago
2008
Embeddings of random variables in reproducing kernel Hilbert spaces (RKHSs) may be used to conduct statistical inference based on higher order moments. For sufficiently rich (char...