Sciweavers

30 search results - page 5 / 6
» Coresets, sparse greedy approximation, and the Frank-Wolfe a...
Sort
View
ICML
2010
IEEE
13 years 6 months ago
Submodular Dictionary Selection for Sparse Representation
We develop an efficient learning framework to construct signal dictionaries for sparse representation by selecting the dictionary columns from multiple candidate bases. By sparse,...
Andreas Krause, Volkan Cevher
OA
1989
237views Algorithms» more  OA 1989»
13 years 9 months ago
Which Triangulations Approximate the Complete Graph?
nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
Gautam Das, Deborah Joseph
ICML
2009
IEEE
14 years 5 months ago
Learning with structured sparsity
This paper investigates a new learning formulation called structured sparsity, which is a naturalextensionofthestandardsparsityconceptinstatisticallearningandcompressivesensing. B...
Junzhou Huang, Tong Zhang, Dimitris N. Metaxas
ICIP
2010
IEEE
13 years 2 months ago
MVMP: Multi-view Matching Pursuit with geometry constraints
Sets of multi-view images that capture plenoptic information from different viewpoints are typically related by geometric constraints. The proper analysis of these constraints is ...
Ivana Tosic, Antonio Ortega, Pascal Frossard
CORR
2010
Springer
93views Education» more  CORR 2010»
13 years 5 months ago
Rank Awareness in Joint Sparse Recovery
In this paper we revisit the sparse multiple measurement vector (MMV) problem, where the aim is to recover a set of jointly sparse multichannel vectors from incomplete measurement...
Mike E. Davies, Yonina C. Eldar