63 search results - page 2 / 13 » Approximating Representations for Large Numerical Databases |
SSDBM
2010
IEEE
13 years 9 months ago
2010
IEEE
Abstract. State-of-the-art numerical solvers in Earth Sciences produce multi terabyte datasets per execution. Operating on increasingly larger datasets becomes challenging due to i...
CISS
2008
IEEE
13 years 11 months ago
2008
IEEE
—Thus far, sparse representations have been exploited largely in the context of robustly estimating functions in a noisy environment from a few measurements. In this context, the...
KDD
2001
ACM
14 years 5 months ago
2001
ACM
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...
SIGMOD
2001
ACM
14 years 5 months ago
2001
ACM
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
ICDE
2010
IEEE
14 years 4 months ago
2010
IEEE
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...