We use the theory and algorithms developed for so-called shiftinvariant spaces to develop a novel distributed architecture for sampling and reconstructing non-bandlimited fields i...
Deciding what to sense is a crucial task, made harder by dependencies and by a nonadditive utility function. We develop approximation algorithms for selecting an optimal set of me...
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...
In this paper we argue for a reconceptualization of the Tree Adjoining Grammar (TAG) formalism, in which the elementary structures are collections of c-command relations, and the ...
In single-particle reconstruction, a 3D structure is reconstructed from a large number of randomly oriented 2D projections, using techniques related to computed tomography. Unlike ...