Sciweavers

1787 search results - page 157 / 358
» Approximation Techniques for Spatial Data
Sort
View
147
Voted
JCNS
2010
90views more  JCNS 2010»
14 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
ICDE
2006
IEEE
239views Database» more  ICDE 2006»
15 years 11 months ago
Grid Representation for Efficient Similarity Search in Time Series Databases
Widespread interest in time-series similarity search has made more in need of efficient technique, which can reduce dimensionality of the data and then to index it easily using a ...
Guifang Duan, Yu Suzuki, Kyoji Kawagoe
VISUALIZATION
1996
IEEE
15 years 9 months ago
Real-time Slicing of Data Space
This can be a costly operation. When the data is arranged according to its three-dimensional coordinates, calculating the contour surfaces requires examining each data cell. Avoidi...
Roger Crawfis
KDD
2001
ACM
192views Data Mining» more  KDD 2001»
16 years 5 months ago
Data mining with sparse grids using simplicial basis functions
Recently we presented a new approach [18] to the classification problem arising in data mining. It is based on the regularization network approach but, in contrast to other method...
Jochen Garcke, Michael Griebel
130
Voted
DASFAA
1999
IEEE
79views Database» more  DASFAA 1999»
15 years 9 months ago
Summary Grids: Building Accurate Multidimensional Histograms
Data summarization is very important for many data analysis tasks. In this paper we propose a simple but efficient data summarization algorithm, which outputs a histogram for mult...
Pedro Furtado, Henrique Madeira