MathDB2 problems
- 0 votes0 replies0 views
Posterior-matching algorithms for improving noisy sorting rate
Posterior-matching sorting conjecture. An algorithm based on the idea of posterior matching could potentially achieve a higher sorting rate.
- 0 votes0 replies1 view
Sampling-without-replacement upper-bound conjecture for the MS algorithm
Sampling-without-replacement upper-bound conjecture. Analogous upper bounds can be established for the algorithm when sampling is without replacement.