This paper examines the ability of greedy algorithms to estimate a block sparse parameter vector from noisy measurements. In particular, block sparse versions of the orthogonal mat...
In this paper, we analyze the behavior of communication networks in which packets are generated dynamically at the nodes and routed in discrete time steps across the edges. We foc...
Matthew Andrews, Baruch Awerbuch, Antonio Fern&aac...
The literature currently provides two ways to establish
point correspondences between images with moving objects.
On one side, there are energy minimization methods
that yield v...
Thomas Brox (University of California, Berkeley), ...
A challenging problem of multi-label learning is that both the label space and the model complexity will grow rapidly with the increase in the number of labels, and thus makes the...
Abstract. We present a universally composable time-stamping scheme based on universal one-way hash functions. The model we use contains an ideal auditing functionality (implementab...