Sciweavers

198 search results - page 1 / 40
» Dynamic spatial approximation trees
Sort
View
SCCC
2003
IEEE
13 years 10 months ago
Improved Deletions in Dynamic Spatial Approximation Trees
The Dynamic Spatial Approximation Tree (dsa–tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alte...
Gonzalo Navarro, Nora Reyes
SISAP
2009
IEEE
122views Data Mining» more  SISAP 2009»
13 years 11 months ago
Dynamic Spatial Approximation Trees for Massive Data
—Metric space searching is an emerging technique to address the problem of efficient similarity searching in many applications, including multimedia databases and other reposito...
Gonzalo Navarro, Nora Reyes
JEA
2008
112views more  JEA 2008»
13 years 4 months ago
Dynamic spatial approximation trees
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
Gonzalo Navarro, Nora Reyes
SISAP
2010
IEEE
108views Data Mining» more  SISAP 2010»
13 years 2 months ago
Enlarging nodes to improve dynamic spatial approximation trees
Marcelo Barroso, Nora Reyes, Rodrigo Paredes
JCNS
2010
90views more  JCNS 2010»
12 years 11 months ago
Fast Kalman filtering on quasilinear dendritic trees
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...
Liam Paninski