JMLR
2012
12 years 2 months ago
2012
In this paper, we propose a novel formulation of the network clique detection problem by introducing a general network data representation framework. We show connections between o...
BSN
2011
IEEE
12 years 11 months ago
2011
IEEE
—Wireless neural recording systems are subject to stringent power consumption constraints to support long-term recordings and to allow for implantation inside the brain. In this ...
ICASSP
2011
IEEE
13 years 3 months ago
2011
IEEE
A nonparametric version of the basis pursuit method is developed for field estimation. The underlying model entails known bases, weighted by generic functions to be estimated fro...
ICASSP
2011
IEEE
13 years 3 months ago
2011
IEEE
Consider the decomposition of a signal into features that undergo transformations drawn from a continuous family. Current methods discretely sample the transformations and apply s...
SIAMIS
2010
13 years 6 months ago
2010
This paper analyzes and improves the linearized Bregman method for solving the basis pursuit and related sparse optimization problems. The analysis shows that the linearized Bregma...
TSP
2008
13 years 11 months ago
2008
We consider the problem of recovering a matrix from its action on a known vector in the setting where the matrix can be represented efficiently in a known matrix dictionary. Conne...
SIAMSC
2008
13 years 11 months ago
2008
The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximat...
CORR
2007
Springer
13 years 11 months ago
2007
Springer
We consider signals and operators in finite dimension which have sparse time-frequency representations. As main result we show that an S-sparse Gabor representation in Cn with re...
FOCM
2008
13 years 12 months ago
2008
We investigate the problem of reconstructing sparse multivariate trigonometric polynomials from few randomly taken samples by Basis Pursuit and greedy algorithms such as Orthogona...
CORR
2010
Springer
13 years 12 months ago
2010
Springer
Finding the sparsest solution for an under-determined linear system of equations D = s is of interest in many applications. This problem is known to be NP-hard. Recent work studie...