- Applied mathematics
- >
- Theoretical computer science
- >
- Algorithms
- >
- Streaming algorithms

- Fields of mathematics
- >
- Applied mathematics
- >
- Algorithms
- >
- Streaming algorithms

- Fields of mathematics
- >
- Mathematical logic
- >
- Algorithms
- >
- Streaming algorithms

- Philosophy of mathematics
- >
- Mathematical logic
- >
- Algorithms
- >
- Streaming algorithms

One-pass algorithm

In computing, a one-pass algorithm or single-pass algorithm is a streaming algorithm which reads its input exactly once. It does so by processing items in order, without unbounded buffering; it reads

Boyer–Moore majority vote algorithm

The Boyer–Moore majority vote algorithm is an algorithm for finding the majority of a sequence of elements using linear time and constant space. It is named after Robert S. Boyer and J Strother Moore,

Lossy Count Algorithm

The lossy count algorithm is an algorithm to identify elements in a data stream whose frequency count exceed a user-given threshold. The algorithm works by dividing the Data Stream into ‘Buckets’ as f

Streaming algorithm

In computer science, streaming algorithms are algorithms for processing data streams in which the input is presented as a sequence of items and can be examined in only a few passes (typically just one

Misra–Gries summary

In the field of streaming algorithms, Misra–Gries summaries are used to solve the frequent elements problem in the data stream model. That is, given a long stream of input that can only be examined on

Misra–Gries heavy hitters algorithm

Misra and Gries defined the heavy-hitters problem(though they did not introduce the term heavy-hitters) and described the first algorithmfor it in the paper Finding repeated elements. Their algorithme

© 2023 Useful Links.