Where communities thrive

  • Join over 1.5M+ people
  • Join over 100K+ communities
  • Free without limits
  • Create your own community
Repo info

    Hi there,
    I am looking for a faster algorithm for counting the number of data points that are close to a particular point in k-dimensional hyperspace? The current method of calculating all the distances to data points is too slow for my application to handle.

    Thanks in advance