Some approaches to improve tree-based nearest neighbour search algorithms (Q2575820): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.patcog.2005.06.007
+Normal rank
@@ Property / OpenAlex ID @@
+W2133161125
@@ Property / OpenAlex ID: W2133161125 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2707395
@@ Property / cites work: Q2707395 / rank @@
+Normal rank
@@ Property / cites work @@
+PCA-based branch and bound search algorithms for computing K nearest neighbors
+Normal rank
@@ Property / cites work @@
+A Branch and Bound Algorithm for Computing k-Nearest Neighbors
+Normal rank
@@ Property / cites work @@
+A Data Structure and an Algorithm for the Nearest Point Problem
+Normal rank
@@ Property / cites work @@
+A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition
+Normal rank
@@ Property / cites work @@
+The String-to-String Correction Problem
@@ Property / cites work: The String-to-String Correction Problem / rank @@
+Normal rank