Sciweavers

433 search results - page 77 / 87
» 1-Bit compressive sensing
Sort
View
ENTCS
2008
92views more  ENTCS 2008»
13 years 9 months ago
Redundancy Elimination for LF
We present a type system extending the dependent type theory LF, whose terms are more amenable to compact representation. This is achieved by carefully omitting certain subterms w...
Jason Reed
CVIU
2006
142views more  CVIU 2006»
13 years 9 months ago
Robust target detection and tracking through integration of motion, color, and geometry
Vision-based tracking is a basic elementary task in many computer vision-based applications such as video surveillance and monitoring, sensing and navigation in robotics, video co...
Harini Veeraraghavan, Paul R. Schrater, Nikolaos P...
CORR
2007
Springer
110views Education» more  CORR 2007»
13 years 9 months ago
Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting
The problem of recovering the sparsity pattern of a fixed but unknown vector β∗ ∈ Rp based on a set of n noisy observations arises in a variety of settings, including subset...
Martin J. Wainwright
JMLR
2008
209views more  JMLR 2008»
13 years 9 months ago
Bayesian Inference and Optimal Design for the Sparse Linear Model
The linear model with sparsity-favouring prior on the coefficients has important applications in many different domains. In machine learning, most methods to date search for maxim...
Matthias W. Seeger
TIT
2008
121views more  TIT 2008»
13 years 9 months ago
Stability Results for Random Sampling of Sparse Trigonometric Polynomials
Recently, it has been observed that a sparse trigonometric polynomial, i.e. having only a small number of non-zero coefficients, can be reconstructed exactly from a small number o...
Holger Rauhut