This paper introduces a robust approach to the problem of edge detection in situations characterized by high levels of image degradation and illumination non-uniformity. Popular e...
Classic results in the theory of regular languages show that the problem of converting an NFA (nondeterministic finite automaton) into a minimal equivalent NFA is NP-hard, even f...
We are interested in the challenging scientific pursuit of how to characterize human activities in any formal meeting situation by tracking people’s positions with a computer vi...
Some computational aspects and behavioral patterns of P systems are considered, emphasizing dynamical properties that turn useful in characterizing the behavior of biological and b...
In this work we introduce, characterize, and provide algorithmic results for (k, +)–distance-hereditary graphs, k ≥ 0. These graphs can be used to model interconnection networ...