774 search results - page 13 / 155 » A subdivision-based algorithm for the sparse resultant |
168
click to vote
ALT
2011
Springer
14 years 3 months ago
2011
Springer
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...
141
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
126
click to vote
ICASSP
2008
IEEE
15 years 9 months ago
2008
IEEE
Consider a scenario where a distributed signal is sparse and is acquired by various sensors that see different versions. Thus, we have a set of sparse signals with both some commo...
83
Voted
ICASSP
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper, we propose a Bayesian Pursuit algorithm for sparse representation. It uses both the simplicity of the pursuit algorithms and optimal Bayesian framework to determine...
212
click to vote
ORL
2011
14 years 9 months ago
2011
We derive a convex relaxation for cardinality constrained Principal Component Analysis (PCA) by using a simple representation of the L1 unit ball and standard Lagrangian duality. ...