2009 International Conference on Information Technology and Computer Science 2009
DOI: 10.1109/itcs.2009.251
View full text |Buy / Rent full text
|
Sign up to set email alerts
|

Abstract: The constructions of Haar wavelet synopses for large datasets have proven to be useful tools for data approximation. Recently, research on constructing wavelet synopses with a guaranteed maximum error has gained attention. The goal is to find optimal synopses that minimize the approximation error under certain metrics. There are two approaches to realize this goal: size bounded and error bounded. In this paper, we provide a new algorithm for building error-bounded synopses. Our approach is based on the heurist… Show more

Help me understand this report

This publication either has no citations yet, or we are still processing them

Set email alert for when this publication receives citations?

See others like this or search for similar articles