Boyer–Moore majority vote algorithm

Known as: Boyer-Moore Majority Vote Algorithm, Moore's voting 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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2006-2015
0120062015

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Big Data situation has placed a tremendous pressure on the existing computational models. The challenges of Big Data call for a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
2016
2016
Given n colored balls, we want to detect if more than bn/2c of them have the same color, and if so find one ball with such… (More)
Is this relevant?
2015
2015
Ultra-critical systems are growing more complex, and future systems are likely to be autonomous and cannot be assured by… (More)
  • figure 1
Is this relevant?
2011
2011
Recent studies have noted extensive inconsistencies in gene start sites among orthologous genes in related microbial genomes… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Review
2009
Review
2009
Recent studies have documented an evolutionarily primitive, early emerging cognitive system for the mental representation of… (More)
Is this relevant?
2006
2006
Following the seminal work of M. Culler and P. Shalen [Culler & Shalen, 1983], and that of A. Casson [Akbulut & McCarthy, 1990… (More)
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?