We address the problem of minimizing power consumption in behavioral synthesis of data-dominated circuits. The complex nature of power as a cost function implies that the effects ...
We explore various techniques to compress a permutation π over n integers, taking advantage of ordered subsequences in π, while supporting its application π(i) and the applicat...
Abstract. Deterministic graph grammars are finite devices which generate the transition graphs of pushdown automata. We define the notion of synchronization by grammars, generalizi...
We present and analyze an algorithm to solve numerically BSDEs based on Picard's iterations and on a sequential control variate technique. Its convergence is geometric. Moreov...
Abstract. Given the size of today’s data, out-of-core visualization techniques are increasingly important in many domains of scientific research. In earlier work a technique cal...
Dan R. Lipsa, R. Daniel Bergeron, Ted M. Sparr, Ro...