Recently, sample complexity bounds have been derived for problems involving linear functions such as neural networks and support vector machines. In many of these theoretical stud...
We describe data structures and algorithms for performing a path-sensitive program analysis to discover equivalences of expressions involving linear arithmetic or uninterpreted fun...
Given an arbitrary network of interconnected nodes, we develop and analyze a distributed strategy that enables a subset of the nodes to calculate any given function of the node val...
Exponential stability of switched linear systems under both arbitrary and proper switching is studied through two suitably defined families of functions called the strong and the...
This paper studies the exponential stabilization problem for discrete-time switched linear systems based on a control-Lyapunov function approach. A number of versions of converse c...