Pages that link to "Item:Q3888322"
From MaRDI portal
The following pages link to Mean, Median and Mode in Binomial Distributions (Q3888322):
Displaying 27 items.
- A lower bound on the probability that a binomial random variable is exceeding its mean (Q334068) (← links)
- Computing highly accurate or exact \(P\)-values using importance sampling (Q434957) (← links)
- Maximal meaningful events and applications to image analysis (Q1430912) (← links)
- Characterising bounded expansion by neighbourhood complexity (Q1621072) (← links)
- An elementary analysis of the probability that a binomial random variable exceeds its expectation (Q1642431) (← links)
- Probability, minimax approximation, and Nash-equilibrium. Estimating the parameter of a biased coin (Q1716851) (← links)
- The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate (Q1725645) (← links)
- Upper bounds on the running time of the univariate marginal distribution algorithm on OneMax (Q1725646) (← links)
- When the a contrario approach becomes generative (Q1800016) (← links)
- The smallest uniform upper bound on the distance between the mean and the median of the binomial and Poisson distributions (Q1892110) (← links)
- Sparse PSD approximation of the PSD cone (Q2118107) (← links)
- Attacks on pseudo random number generators hiding a linear structure (Q2152156) (← links)
- The median of the number of simple paths on three vertices in the random graph (Q2191936) (← links)
- Optimal play for multiple lottery wins (Q2200432) (← links)
- Memetic algorithms outperform evolutionary algorithms in multimodal optimisation (Q2211864) (← links)
- Robust mechanisms for risk-averse sellers (Q2212790) (← links)
- Fast segment insertion and incremental construction of constrained Delaunay triangulations (Q2354921) (← links)
- A new coding-based algorithm for finding closest pair of vectors (Q2420648) (← links)
- On the law of the iterated logarithm for trigonometric series with bounded gaps. II (Q2630472) (← links)
- Bernoulli trials of fixed parity, random and randomly oriented graphs (Q2631092) (← links)
- On the probability that a binomial variable is at most its expectation (Q2658001) (← links)
- Efficient random graph matching via degree profiles (Q2660385) (← links)
- Network Coloring and Colored Coin Games (Q2961393) (← links)
- BOUNDS ON THE CONVERGENCE TIME OF DISTRIBUTED SELFISH BIN PACKING (Q2997921) (← links)
- Successive shortest paths in complete graphs with random edge weights (Q3386534) (← links)
- On dimension-dependent concentration for convex Lipschitz functions in product spaces (Q6164937) (← links)
- On the choice of the optimal single order statistic in quantile estimation (Q6175811) (← links)
