[mlpack-svn] [MLPACK] #285: cover tree could rearrange descendants in memory for faster accesses

[MLPACK Trac]

#285: cover tree could rearrange descendants in memory for faster accesses
-------------------------+--------------------------------------------------
 Reporter:  rcurtin      |        Owner:                                
     Type:  enhancement  |       Status:  new                           
 Priority:  minor        |    Milestone:  mlpack 1.1.0                  
Component:  mlpack       |     Keywords:  cover tree, rearrange, dataset
 Blocking:               |   Blocked By:                                
-------------------------+--------------------------------------------------
 Right now, the dataset which is given to the cover tree when it is built
 does not move any points around in memory; it simply holds references to
 the points in the tree.

 In situations where the descendants are looped over (with NumDescendants()
 and Descendant()), this is far from optimal and could be much faster if
 the points had been arranged in memory such that Descendant(i) just
 returns i plus some constant (the point held by that node).

 This would take some refactoring of the cover tree class but should
 provide decent speedup.

-- 
Ticket URL: <http://trac.research.cc.gatech.edu/fastlab/ticket/285>
MLPACK <www.fast-lab.org>
MLPACK is an intuitive, fast, and scalable C++ machine learning library developed by the FASTLAB at Georgia Tech under Dr. Alex Gray.