[mlpack-svn] r16888 - mlpack/trunk/doc/tutorials/range_search
fastlab-svn at coffeetalk-1.cc.gatech.edu
fastlab-svn at coffeetalk-1.cc.gatech.edu
Mon Jul 28 10:38:58 EDT 2014
Author: rcurtin
Date: Mon Jul 28 10:38:58 2014
New Revision: 16888
Log:
Merge in changes from release branch. I guess I should have done all this
before I branched.
Modified:
mlpack/trunk/doc/tutorials/range_search/range_search.txt
Modified: mlpack/trunk/doc/tutorials/range_search/range_search.txt
==============================================================================
--- mlpack/trunk/doc/tutorials/range_search/range_search.txt (original)
+++ mlpack/trunk/doc/tutorials/range_search/range_search.txt Mon Jul 28 10:38:58 2014
@@ -175,10 +175,11 @@
@subsection cli_ex3_rstut One dataset, range [4.1 4.2], leaf size of 15 points
-The \b mlpack implementation of range search is a dual-tree method, meaning that
-the leaf size of the tree can be changed. Depending on the characteristics of
-the dataset, a larger or smaller leaf size can provide faster computation. The
-leaf size is modifiable through the command-line interface, as shown below.
+The \b mlpack implementation of range search is a dual-tree algorithm; when
+\f$kd\f$-trees are used, the leaf size of the tree can be changed. Depending on
+the characteristics of the dataset, a larger or smaller leaf size can provide
+faster computation. The leaf size is modifiable through the command-line
+interface, as shown below.
@code
$ range_search -r dataset.csv -n neighbors_out.csv -d distances_out.csv -m 4.1 \
More information about the mlpack-svn
mailing list