Work

Revisiting the Majority Problem: Average-Case Analysis with Arbitrarily Many Colours

Year: 2016

Type: article

Abstract: The majority problem is a special case of the heavy hitters problem. Given a collection of coloured balls, the task is to identify the majority colour or state that no such colour exists. Whilst the special case of two-colours has been well studied, the average-case performance for arbitrarily many colours has not. In this paper, we present heuristic analysis of the average-case performance of three deterministic algorithms that appear in the literature. We empirically validate our analysis with large scale simulations.

Source: e-space (Manchester Metropolitan University)

DOI: 10.48550/arxiv.1606.05123

Author: Kleerekoper, Anthony

Institution: Manchester Metropolitan University

Language: English

Topic: Algorithms and Data Compression

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2436082087

FWCI:

Cites: 6

Cited by:

Related to: 20