[{"title":"( 50 个子文件 8.1MB ) ParallelKNN:使用 KD Trees Divide and Conquer 并行实现 KNN 图-源码","children":[{"title":"ParallelKNN-master","children":[{"title":"LGPL <span style='color:#111;'> 25.81KB </span>","children":null,"spread":false},{"title":"src-galois-balltree","children":[{"title":"Galois_BallTree.cpp <span style='color:#111;'> 16.24KB </span>","children":null,"spread":false},{"title":"CMakeLists.txt <span style='color:#111;'> 117B </span>","children":null,"spread":false}],"spread":true},{"title":"data","children":[{"title":"mnist-test.glue <span style='color:#111;'> 1.90MB </span>","children":null,"spread":false},{"title":"frey.dat <span style='color:#111;'> 8.40MB </span>","children":null,"spread":false},{"title":"mnist.dat <span style='color:#111;'> 7.48MB </span>","children":null,"spread":false},{"title":"frey.brute <span style='color:#111;'> 576.27KB </span>","children":null,"spread":false},{"title":"mnist-test.overlap <span style='color:#111;'> 1.90MB </span>","children":null,"spread":false},{"title":"frey.glue <span style='color:#111;'> 576.27KB </span>","children":null,"spread":false},{"title":"mnist-test.dat <span style='color:#111;'> 59.81MB </span>","children":null,"spread":false},{"title":"mnist-test.brute <span style='color:#111;'> 1.90MB </span>","children":null,"spread":false},{"title":"frey.overlap <span style='color:#111;'> 576.27KB </span>","children":null,"spread":false}],"spread":true},{"title":"src-balltree","children":[{"title":"Makefile <span style='color:#111;'> 226B </span>","children":null,"spread":false},{"title":"balltree.cpp <span style='color:#111;'> 12.95KB </span>","children":null,"spread":false}],"spread":true},{"title":"src_kd_galois","children":[{"title":"Galois_KD_tree.cpp <span style='color:#111;'> 15.69KB </span>","children":null,"spread":false},{"title":".DS_Store <span style='color:#111;'> 6.00KB </span>","children":null,"spread":false}],"spread":true},{"title":"src-kdtree","children":[{"title":"kdtree.h <span style='color:#111;'> 783B </span>","children":null,"spread":false},{"title":"Makefile <span style='color:#111;'> 242B </span>","children":null,"spread":false},{"title":"test.cpp <span style='color:#111;'> 2.91KB </span>","children":null,"spread":false},{"title":"kdtree.o <span style='color:#111;'> 135.95KB </span>","children":null,"spread":false},{"title":"kdtree.c <span style='color:#111;'> 7.60KB </span>","children":null,"spread":false},{"title":"libkdtree.a <span style='color:#111;'> 136.54KB </span>","children":null,"spread":false}],"spread":true},{"title":"src_sequential","children":[{"title":"Makefile <span style='color:#111;'> 441B </span>","children":null,"spread":false},{"title":"Point.h <span style='color:#111;'> 4.21KB </span>","children":null,"spread":false},{"title":"Node.h <span style='color:#111;'> 3.53KB </span>","children":null,"spread":false},{"title":"Test_KD_tree.cpp <span style='color:#111;'> 24.70KB </span>","children":null,"spread":false},{"title":"Sequential_KD_tree.cpp <span style='color:#111;'> 3.14KB </span>","children":null,"spread":false},{"title":"KDTree.h <span style='color:#111;'> 11.64KB </span>","children":null,"spread":false},{"title":"BoundedPQueue.h <span style='color:#111;'> 6.61KB </span>","children":null,"spread":false}],"spread":true},{"title":"scripts","children":[{"title":"knn_accuracy.py <span style='color:#111;'> 1.88KB </span>","children":null,"spread":false},{"title":"measure_sklearn_stampede.py <span style='color:#111;'> 870B </span>","children":null,"spread":false},{"title":"run_sklearn.py <span style='color:#111;'> 1.33KB </span>","children":null,"spread":false},{"title":"run_sklearn.pyc <span style='color:#111;'> 935B </span>","children":null,"spread":false}],"spread":true},{"title":"README.md <span style='color:#111;'> 886B </span>","children":null,"spread":false},{"title":"src-chen","children":[{"title":"knn <span style='color:#111;'> 42.14KB </span>","children":null,"spread":false},{"title":"dynamic_array.cpp <span style='color:#111;'> 2.98KB </span>","children":null,"spread":false},{"title":"linear_algebra.cpp <span style='color:#111;'> 7.94KB </span>","children":null,"spread":false},{"title":"Makefile <span style='color:#111;'> 756B </span>","children":null,"spread":false},{"title":"aux_func.h <span style='color:#111;'> 1.41KB </span>","children":null,"spread":false},{"title":"dynamic_array.h <span style='color:#111;'> 761B </span>","children":null,"spread":false},{"title":"linear_algebra.o <span style='color:#111;'> 13.63KB </span>","children":null,"spread":false},{"title":"aux_func.cpp <span style='color:#111;'> 3.11KB </span>","children":null,"spread":false},{"title":"aux_func.o <span style='color:#111;'> 11.84KB </span>","children":null,"spread":false},{"title":"knn_algo.h <span style='color:#111;'> 1.75KB </span>","children":null,"spread":false},{"title":"knn_algo.o <span style='color:#111;'> 18.05KB </span>","children":null,"spread":false},{"title":"knn_algo.cpp <span style='color:#111;'> 13.85KB </span>","children":null,"spread":false},{"title":"linear_algebra.h <span style='color:#111;'> 777B </span>","children":null,"spread":false},{"title":"dynamic_array.o <span style='color:#111;'> 5.24KB </span>","children":null,"spread":false},{"title":"main.cpp <span style='color:#111;'> 3.68KB </span>","children":null,"spread":false},{"title":"main.o <span style='color:#111;'> 2.34KB </span>","children":null,"spread":false}],"spread":false}],"spread":true}],"spread":true}]