Turning Big Data Into Tiny Data: Constant-Size Coresets for -Means, PCA, and Projective Clustering
We develop and analyze a method to reduce the size of a very large set of data points in a
high-dimensional Euclidean space R^d to a small set of weighted points such that the result …
high-dimensional Euclidean space R^d to a small set of weighted points such that the result …
Approximate query processing: What is new and where to go? a survey on approximate query processing
Online analytical processing (OLAP) is a core functionality in database systems. The
performance of OLAP is crucial to make online decisions in many applications. However, it is …
performance of OLAP is crucial to make online decisions in many applications. However, it is …
Frequent directions: Simple and deterministic matrix sketching
We describe a new algorithm called FrequentDirections for deterministic matrix sketching in
the row-update model. The algorithm is presented an arbitrary input matrix A ∈ R^ n * d one …
the row-update model. The algorithm is presented an arbitrary input matrix A ∈ R^ n * d one …
Mithril: Cooperative row hammer protection on commodity dram leveraging managed refresh
Since its public introduction in the mid-2010s, the Row Hammer (RH) phenomenon has
drawn significant attention from the research community due to its security implications …
drawn significant attention from the research community due to its security implications …
Overview of accurate coresets
A coreset of an input set is its small summarization, such that solving a problem on the
coreset as its input, provably yields the same result as solving the same problem on the …
coreset as its input, provably yields the same result as solving the same problem on the …
A structured and scalable mechanism for test access to embedded reusable cores
EJ Marinissen, R Arendsen, G Bos… - … 1998 (IEEE Cat. No …, 1998 - ieeexplore.ieee.org
The main objective of core-based IC design is improvement of design efficiency and time-to-
market. In order to prevent test development from becoming the bottleneck in the entire …
market. In order to prevent test development from becoming the bottleneck in the entire …
Optimal quantile approximation in streams
This paper resolves one of the longest standing basic problems in the streaming
computational model. Namely, optimal construction of quantile sketches. An ε approximate …
computational model. Namely, optimal construction of quantile sketches. An ε approximate …
{HeteroSketch}: Coordinating network-wide monitoring in heterogeneous and dynamic networks
Network monitoring and measurement have always been critical components of network
management. Recent developments in sketch-based monitoring techniques and the …
management. Recent developments in sketch-based monitoring techniques and the …
Data sketches for disaggregated subset sum and frequent item estimation
D Ting - Proceedings of the 2018 International Conference on …, 2018 - dl.acm.org
We introduce and study a new data sketch for processing massive datasets. It addresses two
common problems: 1) computing a sum given arbitrary filter conditions and 2) identifying the …
common problems: 1) computing a sum given arbitrary filter conditions and 2) identifying the …
Approximate query service on autonomous iot cameras
Elf is a runtime for an energy-constrained camera to continuously summarize video scenes
as approximate object counts. Elf's novelty centers on planning the camera's count actions …
as approximate object counts. Elf's novelty centers on planning the camera's count actions …