Computing unrestricted synopses under maximum error bound
type: Item
instance of: scholarly article
title: Computing unrestricted synopses under maximum error bound
zbMATH Open document ID: 1259.68049
author: Yanyan Li
published in: Algorithmica
publication date: 2013-03-05T00:00:00Z
Mathematics Subject Classification ID: 68P30
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 42C40
zbMATH DE Number: 6141215
zbMATH Keywords: approximation algorithm
zbMATH Keywords: approximate query processing
zbMATH Keywords: data compression
zbMATH Keywords: data synopses
zbMATH Keywords: Haar wavelets
MaRDI profile type: Publication
full work available at URL: s00453-011-9571-9
OpenAlex ID: W2065853778
Wikidata QID: Q63457767
cites work: Approximate query processing using wavelets
cites work: Approximation Algorithms for Wavelet Transform Coding of Data Streams
cites work: Database Theory - ICDT 2005
cites work: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
DOI: 10.1007/S00453-011-9571-9
Recommended article: Synthesis with asymptotic resource bounds
Recommended article: On the complexity of computing error bounds
Recommended article: Encodings of Bounded Synthesis
Recommended article: The unbounded-error communication complexity of symmetric functions
Recommended article: Program synthesis in the presence of infinite number of inaccuracies
Recommended article: Q4470563
Recommended article: On Syntactic versus Computational Views of Approximability
Recommended article: Q4721668
description: scientific article; zbMATH DE number 6141215