English
Related papers

Related papers: Model Counting meets F0 Estimation

200 papers

We propose a novel framework for statistical estimation on noisy datasets. Within this framework, we focus on the frequency moments ($F_p$) problem and demonstrate that it is possible to approximate $F_p$ of the unknown ground-truth dataset…

Data Structures and Algorithms · Computer Science 2026-03-13 Kaiwen Liu , Qin Zhang

Emerging applications of machine learning in numerous areas involve continuous gathering of and learning from streams of data. Real-time incorporation of streaming data into the learned models is essential for improved inference in these…

Machine Learning · Computer Science 2020-12-01 Matthew Nokleby , Haroon Raja , Waheed U. Bajwa

In this thesis, we explore streaming algorithms for approximating constraint satisfaction problems (CSPs). The setup is roughly the following: A computer has limited memory space, sees a long "stream" of local constraints on a set of…

Data Structures and Algorithms · Computer Science 2023-04-14 Noah G. Singer

We study the general problem of computing frequency-based functions, i.e., the sum of any given function of data stream frequencies. Special cases include fundamental data stream problems such as computing the number of distinct elements…

Data Structures and Algorithms · Computer Science 2020-10-08 Prantar Ghosh

Frequency estimation in data streams is one of the classical problems in streaming algorithms. Following much research, there are now almost matching upper and lower bounds for the trade-off needed between the number of samples and the…

Computational Complexity · Computer Science 2023-01-16 Shachar Lovett , Jiapeng Zhang

The efficient estimation of frequency moments of a data stream in one-pass using limited space and time per item is one of the most fundamental problem in data stream processing. An especially important estimation is to find the number of…

Data Structures and Algorithms · Computer Science 2010-10-29 Gokarna Sharma , Costas Busch , Srikanta Tirthapura

The study of phase transition phenomenon of NP complete problems plays an important role in understanding the nature of hard problems. In this paper, we follow this line of research by considering the problem of counting solutions of…

Artificial Intelligence · Computer Science 2011-02-25 Minghao Yin , Ping Huang

The exact computation of the number of distinct elements (frequency moment $F_0$) is a fundamental problem in the study of data streaming algorithms. We denote the length of the stream by $n$ where each symbol is drawn from a universe of…

Computational Complexity · Computer Science 2014-02-28 Hartmut Klauck , Ved Prakash

High-dimensional count data arise in applications such as single-cell RNA sequencing and neural spike trains, where mapping between distributions across successive batches or time points form critical components of data analysis. The recent…

Machine Learning · Statistics 2026-05-11 Ganchao Wei , John Pearson

We initiate the study of biological neural networks from the perspective of streaming algorithms. Like computers, human brains suffer from memory limitations which pose a significant obstacle when processing large scale and dynamically…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-10-06 Yael Hitron , Cameron Musco , Merav Parter

The area of online machine learning in big data streams covers algorithms that are (1) distributed and (2) work from data streams with only a limited possibility to store past data. The first requirement mostly concerns software…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-02-19 András A. Benczúr , Levente Kocsis , Róbert Pálovics

We introduce a new computational model for data streams: asymptotically exact streaming algorithms. These algorithms have an approximation ratio that tends to one as the length of the stream goes to infinity while the memory used by the…

Data Structures and Algorithms · Computer Science 2014-08-11 Marc Heinrich , Alexander Munteanu , Christian Sohler

We study distributed algorithms for some fundamental problems in data summarization. Given a communication graph $G$ of $n$ nodes each of which may hold a value initially, we focus on computing $\sum_{i=1}^N g(f_i)$, where $f_i$ is the…

Data Structures and Algorithms · Computer Science 2019-08-07 Hsin-Hao Su , Hoa T. Vu

Tracking and approximating data matrices in streaming fashion is a fundamental challenge. The problem requires more care and attention when data comes from multiple distributed sites, each receiving a stream of data. This paper considers…

Databases · Computer Science 2014-05-01 Mina Ghashami , Jeff M. Phillips , Feifei Li

Due to recent advances in data collection techniques, massive amounts of data are being collected at an extremely fast pace. Also, these data are potentially unbounded. Boundless streams of data collected from sensors, equipments, and other…

Databases · Computer Science 2012-03-12 T Soni Madhulatha

Parallel computing is very important to accelerate the performance of software systems. Additionally, considering that a recurring challenge is to process high data volumes continuously, stream processing emerged as a paradigm and software…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-05-14 Adriano Vogel , Sören Henning , Esteban Perez-Wohlfeil , Otmar Ertl , Rick Rabiser

Community detection is one of the most important problems in network analysis. Among many algorithms proposed for this task, methods based on statistical inference are of particular interest: they are mathematically sound and were shown to…

Social and Information Networks · Computer Science 2019-02-25 Liudmila Prokhorenkova , Alexey Tikhonov

Streaming analysis is widely used in cloud as well as edge infrastructures. In these contexts, fine-grained application performance can be based on accurate modeling of streaming operators. This is especially beneficial for computationally…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-11-30 Hannaneh Najdataei , Vincenzo Gulisano , Alessandro V. Papadopoulos , Ivan Walulya , Marina Papatriantafilou , Philippas Tsigas

In this column, we overview recent progress by many authors on understanding the approximability of constraint satisfaction problems (CSPs) in low-space streaming models. Inspired by this recent progress, we collate nine conjectural lower…

Computational Complexity · Computer Science 2025-10-14 Noah G. Singer

Streaming data are increasingly present in real-world applications such as sensor measurements, satellite data feed, stock market, and financial data. The main characteristics of these applications are the online arrival of data…

Machine Learning · Computer Science 2020-07-01 Vinicius M. A. Souza , Denis M. dos Reis , Andre G. Maletzke , Gustavo E. A. P. A. Batista
‹ Prev 1 2 3 10 Next ›