File tree Expand file tree Collapse file tree 1 file changed +1
-1
lines changed Expand file tree Collapse file tree 1 file changed +1
-1
lines changed Original file line number Diff line number Diff line change @@ -665,7 +665,7 @@ There are two phases of tree traversals used in order to answer a query to find
665665the :math: `m` nearest neighbors of a point :math: `q`. First, a top-down
666666traversal is performed using a binary search to identify the leaf having the
667667longest prefix match (maximum depth) with :math: `q`'s label after subjecting
668- :math: `q` to the same hash functions. :math: `M >> m` points (total candidates)
668+ :math: `q` to the same hash functions. :math: `M \gg m` points (total candidates)
669669are extracted from the forest, moving up from the previously found maximum
670670depth towards the root synchronously across all trees in the bottom-up
671671traversal. `M ` is set to :math: `cl` where :math: `c`, the number of candidates
You can’t perform that action at this time.
0 commit comments