114 search results - page 7 / 23 » Dynamic Spatial Approximation Trees for Massive Data |
SSD
2001
Springer
14 years 11 days ago
2001
Springer
The design of external index structures for one- and multidimensional extended objects is a long and well studied subject in basic database research. Today, more and more commercia...
ISBI
2008
IEEE
14 years 8 months ago
2008
IEEE
Multi-subject analysis of functional Magnetic Resonance Imaging (fMRI) data relies on within-subject studies, which are usually conducted using a massively univariate approach. In...
JCNS
2010
13 years 2 months ago
2010
Optimal filtering of noisy voltage signals on dendritic trees is a key problem in computational cellular neuroscience. However, the state variable in this problem -- the vector of...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
NIPS
2004
13 years 9 months ago
2004
This paper concerns approximate nearest neighbor searching algorithms, which have become increasingly important, especially in high dimensional perception areas such as computer v...