CiteSeerX — Search Results — Polynomial-time inverse computation for accumulative functions with multiple data traversals.

Results 1 - 10 of 108

Polynomial-Time Inverse Computation for Accumulative Functions with Multiple Data Traversals

by Kazutaka Matsuda, Kazuhiro Inaba, Keisuke Nakano

"... Inverse computation has many applications such as serialization/deserialization, providing support for undo, and test-case generation for software testing. In this paper, we propose an inverse computation method that always terminates for a class of functions known as parameter-linear macro tree tra ..."

Abstract - Cited by 1 (0 self) - Add to MetaCart

transducers, which involve multiple data traversals and the use of accumulations. The key to our method is the observation that a function in the class can be regarded as a non-accumulative context-generating transformation without multiple data traversals. Accordingly, we demonstrate that it is easy

1 Computation Alignment: Capacity Approximation without Noise Accumulation

by Urs Niesen, Bobak Nazer, Phil Whiting

"... ar ..."

Abstract - Add to MetaCart

Abstract not found

Volume I: Computer Science and Software Engineering

by Ioannis Z. Emiris, Victor Y. Pan, Elias P. Tsigaridas, Allen Tucker, Teo Gonzales, Jorge L. Diaz-herrera, Ioannis Z. Emiris, Victor Y. Pan, Elias P. Tsigaridas , 2013

"... Algebraic algorithms deal with numbers, vectors, matrices, polynomials, for-mal power series, exponential and differential polynomials, rational functions, algebraic sets, curves and surfaces. In this vast area, manipulation with matri-ces and polynomials is fundamental for modern computations in Sc ..."

Abstract - Add to MetaCart

Algebraic algorithms deal with numbers, vectors, matrices, polynomials, for-mal power series, exponential and differential polynomials, rational functions, algebraic sets, curves and surfaces. In this vast area, manipulation with matri-ces and polynomials is fundamental for modern computations

IOS Press There and Back Again

by Olivier Danvy, Mayer Goldberg

"... Abstract. We present a programming pattern where a recursive function defined over a data structure traverses another data structure at return time. The idea is that the recursive calls get us ‘there’ by traversing the first data structure and the returns get us ‘back again ’ while traversing the se ..."

Abstract - Add to MetaCart

the second data structure. We name this programming pattern of traversing a data structure at call time and another data structure at return time “There And Back Again ” (TABA). The TABA pattern directly applies to computing symbolic convolutions and to multiplying polynomials. It also blends well with other

Journal of Scientific Computing manuscript No. (will be inserted by the editor) Data-driven Multi-scale Non-local Wavelet Frame Construction and Image Recovery

by Yuhui Quan, Hui Ji, Zuowei Shen, Y. Quan, H. Ji, Z. Shen

"... Abstract By assuming that images of interest can be sparsely modelled by some transform, the sparsity-based regularization has been one promising approach for solving many ill-posed inverse problems in image recovery. One often-used type of systems for sparsifying images is wavelet tight frames, whi ..."

Abstract - Add to MetaCart

Abstract By assuming that images of interest can be sparsely modelled by some transform, the sparsity-based regularization has been one promising approach for solving many ill-posed inverse problems in image recovery. One often-used type of systems for sparsifying images is wavelet tight frames