Sciweavers

32 search results - page 5 / 7
» A sharp threshold in proof complexity
Sort
View
CSL
2009
Springer
15 years 10 months ago
Model Checking FO(R) over One-Counter Processes and beyond
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
Anthony Widjaja To
122
Voted
NIPS
2008
15 years 5 months ago
High-dimensional support union recovery in multivariate regression
We study the behavior of block 1/ 2 regularization for multivariate regression, where a K-dimensional response vector is regressed upon a fixed set of p covariates. The problem of...
Guillaume Obozinski, Martin J. Wainwright, Michael...
140
Voted
CORR
2007
Springer
110views Education» more  CORR 2007»
15 years 3 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
123
Voted
TIP
2010
154views more  TIP 2010»
14 years 10 months ago
Efficient Fourier-Wavelet Super-Resolution
Super-resolution (SR) is the process of combining multiple aliased low-quality images to produce a high-resolution high-quality image. Aside from registration and fusion of low-res...
M. Dirk Robinson, Cynthia A. Toth, Joseph Y. Lo, S...
115
Voted
ISSAC
2009
Springer
121views Mathematics» more  ISSAC 2009»
15 years 10 months ago
Faster real feasibility via circuit discriminants
We show that detecting real roots for honestly n-variate (n + 2)-nomials (with integer exponents and coefficients) can be done in time polynomial in the sparse encoding for any ...
Frédéric Bihan, J. Maurice Rojas, Ca...