8 search results - page 1 / 2 » Average-case lower bounds for the plurality problem |
TALG
2008
13 years 4 months ago
2008
Given a set of n elements, each of which is colored one of c 2 colors, we must determine an element of the plurality (most frequently occurring) color by pairwise equal/unequal co...
COCOON
2005
Springer
13 years 10 months ago
2005
Springer
In the well-studied Majority problem, we are given a set of n balls colored with two or more colors, and the goal is to use the minimum number of color comparisons to find a ball ...
SIGECOM
2005
ACM
13 years 10 months ago
2005
ACM
We determine the communication complexity of the common voting rules. The rules (sorted by their communication complexity from low to high) are plurality, plurality with runoff, ...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
CPM
2008
Springer
13 years 6 months ago
2008
Springer
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...