pith. sign in

arxiv: 1605.06754 · v2 · pith:KFOC5L2Znew · submitted 2016-05-22 · 🧮 math.CO

Minimal networks for sensor counting problem using discrete Euler calculus

classification 🧮 math.CO
keywords acyclicnetworkspointssensortargetsenumeratingeulerreducible
0
0 comments X
read the original abstract

This paper proposes a method to reduce noise in acyclic sensor networks enumerating targets using the integral theory with respect to Euler characteristic. For an acyclic network (a partially ordered set) equipped with sensors detecting targets, we find reducible points for enumerating targets, as a generalization of weak beat points (homotopically reducible points). This theory is useful for improving the reliability and optimization of acyclic sensor networks.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.