Sciweavers

2949 search results - page 50 / 590
» Universal Sparse Modeling
Sort
View
103
Voted
CORR
2010
Springer
169views Education» more  CORR 2010»
15 years 20 days ago
Near-Oracle Performance of Greedy Block-Sparse Estimation Techniques from Noisy Measurements
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...
Zvika Ben-Haim, Yonina C. Eldar
83
Voted
FOCS
1996
IEEE
15 years 4 months ago
Universal Stability Results for Greedy Contention-Resolution Protocols
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...
CVPR
2009
IEEE
16 years 7 months ago
Large Displacement Optical Flow
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), ...
135
Voted
JMLR
2012
13 years 3 months ago
Multi-label Subspace Ensemble
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...
Tianyi Zhou, Dacheng Tao
ISW
2005
Springer
15 years 6 months ago
Universally Composable Time-Stamping Schemes with Audit
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...
Ahto Buldas, Peeter Laud, Märt Saarepera, Jan...