Sciweavers

3250 search results - page 613 / 650
» An Algorithm to Solve a Linear Program
Sort
View
TSP
2008
151views more  TSP 2008»
13 years 8 months ago
Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of...
Moshe Mishali, Yonina C. Eldar
SIAMJO
2002
92views more  SIAMJO 2002»
13 years 8 months ago
Generalized Bundle Methods
We study a class of generalized bundle methods for which the stabilizing term can be any closed convex function satisfying certain properties. This setting covers several algorithm...
Antonio Frangioni
CSDA
2007
169views more  CSDA 2007»
13 years 8 months ago
A null space method for over-complete blind source separation
In blind source separation, there are M sources that produce sounds independently and continuously over time. These sounds are then recorded by m receivers. The sound recorded by ...
Ray-Bing Chen, Ying Nian Wu
SIAMIS
2010
156views more  SIAMIS 2010»
13 years 3 months ago
Learning the Morphological Diversity
This article proposes a new method for image separation into a linear combination of morphological components. Sparsity in fixed dictionaries is used to extract the cartoon and osc...
Gabriel Peyré, Jalal Fadili, Jean-Luc Starc...
TASE
2010
IEEE
13 years 3 months ago
Robust Calibration for Localization in Clustered Wireless Sensor Networks
This paper presents a robust calibration procedure for clustered wireless sensor networks. Accurate calibration of between-node distances is one crucial step in localizing sensor n...
Jung Jin Cho, Yu Ding, Yong Chen, Jiong Tang