Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(4)
Approval Voting
Linear Time
Time Complexity
Total Order
Related Publications
(7)
A comparison of voting algorithms for nversion programming
A theoretical investigation of generalized voters for redundant systems
Application of voting to fusion of purposive modules: An experimental investigation
Voting using predispositions
Ensemble Methods in Machine Learning
Subscribe
Academic
Publications
Voting algorithms
Voting algorithms,10.1109/24.370218,IEEE Transactions on Reliability,B. Parhami
Edit
Voting algorithms
(
Citations: 88
)
BibTex

RIS

RefWorks
Download
B. Parhami
This paper presents efficient nway plurality and threshold voting algorithms based on the type of voting (exact, inexact, or approval), rule for output selection (plurality or threshold) and properties of the input object space (size and structure). Exact voting is the most common voting method and is the easiest to implement. Inexact voting algorithms are more complicated due to intransitivity of approximate equality. In approval voting, each input to the voting process consists of a finite or infinite set of values that have been “approved” by the corresponding computation channel and the value, or set of values, with the highest
approval voting
must emerge as output. Multiple approved values can result from a nonunique answer to a given problem or from uncertainties in the solution process. For exact voting, the complexity of an nway voting algorithm depends on the structure of the input object space. Threshold voting often requires less time and space, except when the threshold is very small. The author extends the techniques for designing efficient exact voting algorithms to inexact and
approval voting
schemes. Results show that optimal lineartime (in n) voting algorithms are available when the input object space is small. Next in the timecomplexity hierarchy is the case of a totallyordered object space that supports worstcase order[n·log(n)]time algorithms for both exact and inexact voting as well as for certain approvalvoting schemes
Journal:
IEEE Transactions on Reliability  TR
, vol. 43, no. 4, pp. 617629, 1994
DOI:
10.1109/24.370218
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
ieeexplore.ieee.org
)
(
ieeexplore.ieee.org
)
Citation Context
(52)
...Commonly used methods in this field are the weighted average method, various voting algorithms based on crisp numbers (like e. g. threshold and median voter, see [
8
]) and the already mentioned Kalman filter as well as other more elaborate estimation and inference methods...
Sebastian Blank
,
et al.
A fuzzy approach to low level sensor fusion with limited system knowle...
...In the second step these hypotheses are verified executing a ranked voting procedure [
33
] over the sorted qualityof fit criteria (the measurement of fit, the number of interior points and the number of points on the Superquadrics surface) to robustly select the final object pose...
...To achieve this a voting [
33
] for the pose hypotheses is proposed considering three quality of fit constraints: the measure...
...These two evaluation criteria are exploited to increase the detection robustness using again voting [
33
]...
Georg Biegelbauer
,
et al.
Modelbased 3D object detection
...Once all the replicated jobs are done, a vote algorithm [
5
] is often used to decide which result is the right one...
Anne Benoit
,
et al.
Throughput optimization for microfactories subject to task and machin...
...The major areas of application of this type of voter are in bus coding techniques [1][2][3], NModular Redundancy (NMR) [
4
], median filtering [6], pattern matching [7], and Selfchecking circuits...
...There have been analog implementations of a majority voter [
4
], which is more efficient than a completely digital one...
...[
4
]. In this case, the decision of the voter will decide whether the fault incurred in the system is tolerable or not...
Bharghava Rajaram
,
et al.
Inexact Decision Circuits: An Application to Hamming Weight Threshold ...
...A common theme is the integration of smart algorithms into the faulttolerance voter [
6
]...
Neal Y. Lii
,
et al.
Redundant Dissimilar Sensor Fusion with Dynamic Driver Input Classific...
References
(14)
The weighted median filter
(
Citations: 214
)
D. R. K. Brownrigg
Journal:
Communications of The ACM  CACM
, vol. 27, no. 8, pp. 807818, 1984
On the Reliability of ConsensusBased FaultTolerant Distributed Compting Systems
(
Citations: 25
)
Özalp Babaoglu
Journal:
ACM Transactions on Computer Systems  TOCS
, vol. 5, no. 4, pp. 394416, 1987
Vote Assignments in Weighted Voting Mechanisms
(
Citations: 18
)
Zhijun Tong
,
Richard Y. Kain
Journal:
IEEE Transactions on Computers  TC
, vol. 40, no. 5, pp. 664667, 1991
Dynamic voting algorithms for maintaining the consistency of a replicated database
(
Citations: 198
)
Sushil Jajodia
,
David Mutchler
Journal:
ACM Transactions on Database Systems  TODS
, vol. 15, no. 2, pp. 230280, 1990
An Experimental Evaluation of the Assumption of Independence in Multiversion Programming
(
Citations: 304
)
John C. Knight
,
Nancy G. Leveson
Journal:
IEEE Transactions on Software Engineering  TSE
, vol. 12, no. 1, pp. 96109, 1986
Sort by:
Citations
(88)
Interval Type2 fuzzy voter design for fault tolerant systems
(
Citations: 4
)
Ondrej Linda
,
Milos Manic
Journal:
Information Sciences  ISCI
, vol. 181, no. 14, pp. 29332950, 2011
A fuzzy approach to low level sensor fusion with limited system knowledge
(
Citations: 1
)
Sebastian Blank
,
T. Föhst
,
K. Berns
Published in 2010.
Modelbased 3D object detection
(
Citations: 2
)
Georg Biegelbauer
,
Markus Vincze
,
Walter Wohlkinger
Journal:
Machine Vision and Applications  MVA
, vol. 21, no. 4, pp. 497516, 2010
Throughput optimization for microfactories subject to task and machine failures
Anne Benoit
,
Alexandru Dobrila
,
JeanMarc Nicod
,
Laurent Philippe
Conference:
Symposium on Parallel and Distributed Processing  SPDP
, pp. 18, 2010
Inexact Decision Circuits: An Application to Hamming Weight Threshold Voting
Bharghava Rajaram
,
Abinesh Ramachandran
,
Suresh Purini
,
Govindarajulu Regeti
Conference:
VLSI Design
, pp. 158163, 2010