Computer scientist breaks limit unchanged since 1996
โฎ BeforeDistance estimates across large networks were less reliable for closely connected points.
โ
NowA new algorithm gives more reliable estimates for those points without sacrificing speed.
In short
- The problem concerns how computers calculate distances across enormous networks.
- The new algorithm gives more reliable estimates for closely connected points.
- It keeps speed, overcoming a longstanding limitation of earlier methods.
Why it's good news
The limit had stood since 1996, so earlier methods had to accept a trade-off on closely connected points. The new approach samples network connections at multiple scales, which removes that trade-off. The source describes the result as a breakthrough but does not describe real-world deployment.
Advertisement
From ScienceDaily
A computer scientist has achieved a breakthrough in a nearly 25-year-old problem involving how computers calculate distances across enormous networks. The new algorithm delivers more reliable estimates for closely connected points without sacrificing speed, overcoming a longstanding limitation of earlier methods. Its secret lies in a smarter way of sampling network connections at multiple scales.
Ask this story
More like this
Advertisement