Given an edge-weighted tree T, a k-trunk is a subtree Tk with k leaves in T which minimizes the sum of the distances of all vertices in T from Tk plus the weight of Tk. In this pa...
Ultimately being motivated by facilitating space-variant blind deconvolution, we present a class of linear transformations, that are expressive enough for space-variant filters, ...
Michael Hirsch, Suvrit Sra, Bernhard Schöpf, Stef...
We describe LEAP (Localized Encryption and Authentication Protocol), a key management protocol for sensor networks that is designed to support in-network processing, while at the ...
We develop a Ranking and Selection procedure for selecting the best configuration based on a transient mean performance measure. The procedure extends the OCBA approach to systems...
Douglas J. Morrice, Mark W. Brantley, Chun-Hung Ch...
The use of well-nested linear context-free rewriting systems has been empirically motivated for modeling of the syntax of languages with discontinuous constituents or relatively f...