Analytic Properties of Trackable Weak Models

@article{Chilenski2020AnalyticPO,
  title={Analytic Properties of Trackable Weak Models},
  author={M. Chilenski and G. Cybenko and I. Dekine and Piyush Kumar and G. Raz},
  journal={IEEE Transactions on Network Science and Engineering},
  year={2020},
  volume={7},
  pages={2866-2875}
}
We present new results on inferring the hidden states in trackable weak models. A weak model is a directed graph where each node has a set of colors which may be emitted when that node is visited. A hypothesis is a node sequence consistent with a given color sequence. A weak model is trackable if the worst case number of hypotheses grows polynomially in the sequence length. We show that the number of hypotheses in strongly-connected trackable models is bounded by a constant. We also consider… Expand
1 Citations
Identifying class of previously unseen programs using RF side channels

References

SHOWING 1-10 OF 17 REFERENCES
Observability Properties of Colored Graphs
  • 3
  • PDF
Observable graphs
  • 9
  • PDF
Markov property for a function of a Markov chain: A linear algebra approach
  • 41
  • Highly Influential
  • PDF
Distance measures for nonparametric weak process models
  • Yong Sheng, G. Cybenko
  • Mathematics, Computer Science
  • 2005 IEEE International Conference on Systems, Man and Cybernetics
  • 2005
  • 12
Lumpings of Markov Chains, Entropy Rate Preservation, and Higher-Order Lumpability
  • 16
  • PDF
Cryptographic Limitations on Learning Boolean Formulae and Finite Automata
  • 603
  • PDF
Elements of Information Theory
  • 40,500
  • PDF
Introduction to Probability
  • 2,766
  • Highly Influential
  • PDF
...
1
2
...