In this paper, general guidelines and specific algorithms for code transformations between breadth-first (BF) and depth-first (DF) linear quadtrees are proposed. Each algorithm ha...
This paper briefly presents an efficient and intuitive 3D freeform deformation approach based on iterative affine transformations, a generalized de Casteljau algorithm, whereby th...
We study automata for capturing the transformations in practical natural language processing systems, especially those that translate between human languages. For several variation...
Abstract— Our main goal in this paper is to set the foundations of a general continuous-domain framework for designing steerable, reversible signal transformations (a.k.a. frames...
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...
Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric ...