[mlpack-svn] r16887 - mlpack/tags/mlpack-1.0.9/doc/tutorials/range_search

[fastlab-svn at coffeetalk-1.cc.gatech.edu]

Author: rcurtin
Date: Mon Jul 28 10:37:45 2014
New Revision: 16887

Log:
Some clarification on the leaf size.


Modified:
   mlpack/tags/mlpack-1.0.9/doc/tutorials/range_search/range_search.txt

Modified: mlpack/tags/mlpack-1.0.9/doc/tutorials/range_search/range_search.txt
==============================================================================
--- mlpack/tags/mlpack-1.0.9/doc/tutorials/range_search/range_search.txt	(original)
+++ mlpack/tags/mlpack-1.0.9/doc/tutorials/range_search/range_search.txt	Mon Jul 28 10:37:45 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 \