Sciweavers

358 search results - page 37 / 72
» Sparse squares of polynomials
Sort
View
ICDCS
2008
IEEE
14 years 4 months ago
Performance Analysis of Group Based Detection for Sparse Sensor Networks
In this paper, we analyze the performance of group based detection in sparse sensor networks, when the system level detection decision is made based on the detection reports gener...
Jingbin Zhang, Gang Zhou, Sang Hyuk Son, John A. S...
CORR
2012
Springer
218views Education» more  CORR 2012»
12 years 5 months ago
Robust 1-bit compressed sensing and sparse logistic regression: A convex programming approach
This paper develops theoretical results regarding noisy 1-bit compressed sensing and sparse binomial regression. We demonstrate that a single convex program gives an accurate estim...
Yaniv Plan, Roman Vershynin
CG
2004
Springer
13 years 10 months ago
Point cloud surfaces using geometric proximity graphs
We present a new definition of an implicit surface over a noisy point cloud, based on the weighted least squares approach. It can be evaluated very fast, but artifacts are signifi...
Jan Klein, Gabriel Zachmann
ICASSP
2010
IEEE
13 years 10 months ago
Reconstruction of sparse signals from distorted randomized measurements
In this paper we show that, surprisingly, it is possible to recover sparse signals from nonlinearly distorted measurements, even if the nonlinearity is unknown. Assuming just that...
Petros Boufounos
COLT
2005
Springer
14 years 3 months ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon