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

DOI10.1016/J.TCS.2015.07.005zbMATH Open1332.68264OpenAlexW2345617582MaRDI QIDQ897966FDOQ897966

Authors: Peter Brass, Hyeon-Suk Na, 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

Recommendations

• Local event boundary detection with unreliable sensors: analysis of the majority vote scheme
• scientific article; zbMATH DE number 1978131
• \((\alpha,\tau )\)-monitoring for event detection in wireless sensor networks
• Algorithmic Aspects of Wireless Sensor Networks
• Barrier coverage

zbMATH Keywords

algorithmcomputational geometryboundary detectionmajority vote schemeunreliable sensor

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897966)