For an integer r > 0, a conditional (k, r)-coloring of a graph G is a proper k-coloring of the vertices of G such that every vertex of degree at least r in G will be adjacent t...
Hong-Jian Lai, Jianliang Lin, Bruce Montgomery, Ta...
Event semantics in general and event type coercion in particular have been a challenging yet rewarding topic in verbal semantics (Pustejovsky, 1995). However, there have been few ...
In this paper we present various algorithms both for stability and performance analysis of discrete-time Piece-Wise Affine (PWA) systems. For stability, different classes of Lyapu...
Giancarlo Ferrari-Trecate, Francesco Alessandro Cu...
Binary Decision Diagrams (BDDs) often fail to exploit sharing between Boolean functions that differ only in their support variables. In a memory circuit, for example, the function...
Publish/subscribe infrastructures are used as the basic communication and integration framework in many application domains. The majority of those infrastructures, however, fall s...