Local event boundary detection with unreliable sensors: analysis of the majority vote scheme

DOI10.1016/j.tcs.2015.07.005zbMath1332.68264OpenAlexW2345617582MaRDI QIDQ897966

Hyeon-Suk Na, Peter Brass, Chan-Su Shin

Publication date: 8 December 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.07.005

zbMATH Keywords

algorithmcomputational geometryboundary detectionmajority vote schemeunreliable sensor

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A guided tour of Chernoff bounds
• The number of fixed points of the majority rule
• Isotropic majority-vote model on a square lattice
• Local majorities, coalitions and monopolies in graphs: A review
• A survey of outlier detection methodologies
• An asymptotic analysis of some expert fusion methods
• Boundary Detection Through Dynamic Polygons
• Listen to Your Neighbors: How (Not) to Reach a Consensus

This page was built for publication: Local event boundary detection with unreliable sensors: analysis of the majority vote scheme