In this paper we present optimum interval routing algorithms for message passing networks that have topological structure defined by k-caterpillars and maximal outer planar graph...
in this paper, we describe the acquisition iuld (Irganization of knowledge sources fur machine translation (MT) systems. It has heen liointed out by many users that one of the mos...
This paper proposes a disturbance-based control parametrization under the Model Predictive Control framework for constrained linear discrete time systems with bounded additive dis...
We give a bound on the reconstructibility of an action G X in terms of the reconstructibility of a the action N X, where N is a normal subgroup of G, and the reconstructibility o...
We show that computing the lexicographically first four-coloring for planar graphs is p 2hard. This result optimally improves upon a result of Khuller and Vazirani who prove this ...