Computer Science
Near-optimal parallel M-matrix scaling
A new poly-logarithmic iteration algorithm solves the scaling of symmetric M-matrices to high accuracy.
A new poly-logarithmic iteration algorithm solves the scaling of symmetric M-matrices to high accuracy.
Researchers establish optimal constants for exponential sums involving multiplicative functions and rational approximations.
Researchers calibrated confidence scores to estimate the probability that predicted complexes exceed a DockQ threshold.