Universal Method to Sort Complex Information Found

Over the past few decades, top minds in computer science have applied themselves to finding a better way to solve the nearest neighbor problem. In particular, they've tried to address complications that arise because different data sets can use very different definitions of what it means for two points to be "close" to one another.

Now, a team of computer scientists—including former Visitor Alexandr Andoni and former Member Assaf Naor—has come up with a radically new way of solving nearest neighbor problems.

Read more at Quanta.