Parallel and distributed systems exercise 2: ditributed all-kNN algorithm.
Você não pode selecionar mais de 25 tópicos Os tópicos devem começar com uma letra ou um número, podem incluir traços ('-') e podem ter até 35 caracteres.
 
 
 

46 linhas
1.1 KiB

  1. /*!
  2. * \file main.cpp
  3. * \brief Main application file
  4. *
  5. * \author
  6. * Christos Choutouridis AEM:8997
  7. * <cchoutou@ece.auth.gr>
  8. */
  9. #include <iostream>
  10. // Definition of the kNN result struct
  11. typedef struct knnresult{
  12. int * nidx; //!< Indices (0-based) of nearest neighbors [m-by-k]
  13. double * ndist; //!< Distance of nearest neighbors [m-by-k]
  14. int m; //!< Number of query points [scalar]
  15. int k; //!< Number of nearest neighbors [scalar]
  16. } knnresult;
  17. //! Compute k nearest neighbors of each point in X [n-by-d]
  18. /*!
  19. \param X Corpus data points [n-by-d]
  20. \param Y Query data points [m-by-d]
  21. \param n Number of corpus points [scalar]
  22. \param m Number of query points [scalar]
  23. \param d Number of dimensions [scalar]
  24. \param k Number of neighbors [scalar]
  25. \return The kNN result
  26. */
  27. knnresult kNN(double * X, double * Y, int n, int m, int d, int k) {
  28. }
  29. int main () {
  30. std::cout << "Lets start!\n";
  31. return 0;
  32. }