20 results for βprobability theoryβ
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.β
Want pure semantic search? Try claim verification β
This paper provides an information-theoretic analysis of Yager's negation of probability distributions and its generalizations.
This paper provides an introduction to modern developments in combinatorial discrepancy theory, focusing on algorithmic and convex geometric ideas.
This paper investigates the reliability of organizations of unreliable problem-solvers and derives composition laws for reliability and cost.
This paper proves conditions for efficiently approximating expectations of certain functions with respect to standard Gaussian or symmetric exponential probability measures.
The paper generalizes the convex-algebra interchange axiom to support full Bayesian conditioning.
This paper derives bounds on the probability of incorrect clustering of noisy short sequences using statistically optimal rules, focusing on DNA storage decoders.
The paper proves a stochastic comparison for Gaussian maxima, resolving the Weak Simplex Conjecture and proving the Simplex Mean Width Conjecture.
The paper shows that a random linear map behaves similarly to a fully random map in terms of expected loads and concentration of bin loads.
Determines the limiting distribution of the rank of a random $k$-XORSAT matrix beyond the satisfiability threshold.
This paper introduces a novel algorithm for generating k Hamming weight binary words in linear time while minimizing random bit consumption.
Computes class probabilities in block-independent disjoint probabilistic databases.
This paper provides non-asymptotic and explicit estimates for the exponential deviation inequalities of the HyperLogLog estimator.
Determines the fastest exponential decay rate of decision error probability under hypothesis $\mathcal{H}_1$ when one outlier sequence among $2^{nR}$ length-$n$ random sequences is assumed to follow dβ¦
The paper proves that binary sequences derived from permutations are always X-rays of doubly stochastic matrices by relaxing constraints.
This paper presents a set of formulas and equations to compute the longest counting sequence of convex polyominoes of degree of convexity at most 2.
This paper presents an epistemic logic framework for studying randomized algorithms in distributed computation.
This paper develops local certificates for population-risk increments around a current model.