We give a new, and hopefully more easily understandable, structural proof of the decomposition of a k-valued transducer into k unambiguous functional ones, a result established by...
Abstract. Let G be a directed planar graph of complexity n, each arc having a nonnegative length. Let s and t be two distinct faces of G; let s1, . . . , sk be vertices incident wi...
Compressive sampling offers a new paradigm for acquiring signals that are compressible with respect to an orthonormal basis. The major algorithmic challenge in compressive sampling...
Abstract. We define and construct efficient depth-universal and almostsize-universal quantum circuits. Such circuits can be viewed as generalpurpose simulators for central classes ...
Debajyoti Bera, Stephen A. Fenner, Frederic Green,...
Abstract. We are concerned with demonstrating productivity of specifications of infinite streams of data, based on orthogonal rewrite rules. In general, this property is undecidabl...