From 38efcafe545bb337c98ed4d52c911f87bce8b989 Mon Sep 17 00:00:00 2001 From: rriegel Date: Fri, 8 Jun 2007 18:16:34 +0000 Subject: [PATCH] mention of trees --- fastlib/u/rriegel/nips07/gnp_nips07.tex | 4 +++- 1 file changed, 3 insertions(+), 1 deletion(-) diff --git a/fastlib/u/rriegel/nips07/gnp_nips07.tex b/fastlib/u/rriegel/nips07/gnp_nips07.tex index 6d990525a2..598111f7cd 100644 --- a/fastlib/u/rriegel/nips07/gnp_nips07.tex +++ b/fastlib/u/rriegel/nips07/gnp_nips07.tex @@ -919,7 +919,9 @@ involves trees formed on the inputs sets. trees to obtain $\kdleft{X} \cup \kdright{X} = X$ and $\kdleft{Y} \cup \kdright{Y} = Y$. \end{definition} -\noindent It is clear that partitioning data in this manner will be fast, but +\noindent It is clear that partitioning data in this manner will be +fast, and for problems involving points in a metric space, spatially +informed trees formed on the input sets tend to yield useful bounds. Trees built for the inputs sets may also serve other useful purposes, such as facilitating rapid, bottom-up precomputation of statistics and