|
|
|
|
|
|
by karterk
3975 days ago
|
|
|
Implementing all-pairs similarity search on a few hundred million records. Naively approached, the complexity of this is O(N^2), so had to come up with novel ways to make it finish in a reasonable amount of time and with limited resources. |
|
|