Sciweavers

95 search results - page 1 / 19
» Graph summarization with bounded error
Sort
View
SIGMOD
2008
ACM
116views Database» more  SIGMOD 2008»
14 years 5 months ago
Graph summarization with bounded error
Saket Navlakha, Rajeev Rastogi, Nisheeth Shrivasta...
ICDT
2009
ACM
148views Database» more  ICDT 2009»
14 years 5 months ago
Tight results for clustering and summarizing data streams
In this paper we investigate algorithms and lower bounds for summarization problems over a single pass data stream. In particular we focus on histogram construction and K-center c...
Sudipto Guha
SSDBM
2000
IEEE
168views Database» more  SSDBM 2000»
13 years 8 months ago
pCube: Update-Efficient Online Aggregation with Progressive Feedback and Error Bounds
Multidimensional data cubes are used in large data warehouses as a tool for online aggregation of information. As the number of dimensions increases, supporting efficient queries ...
Mirek Riedewald, Divyakant Agrawal, Amr El Abbadi
ASPLOS
2004
ACM
13 years 10 months ago
Fingerprinting: bounding soft-error detection latency and bandwidth
Recent studies have suggested that the soft-error rate in microprocessor logic will become a reliability concern by 2010. This paper proposes an efficient error detection techniqu...
Jared C. Smolens, Brian T. Gold, Jangwoo Kim, Baba...
PODS
2009
ACM
100views Database» more  PODS 2009»
14 years 5 months ago
Space-optimal heavy hitters with strong error bounds
The problem of finding heavy hitters and approximating the frequencies of items is at the heart of many problems in data stream analysis. It has been observed that several propose...
Radu Berinde, Graham Cormode, Piotr Indyk, Martin ...