Sciweavers

749 search results - page 141 / 150
» Scenario based Analysis of Linear Computations
Sort
View
CORR
2010
Springer
130views Education» more  CORR 2010»
14 years 11 months ago
Phase Transitions for Greedy Sparse Approximation Algorithms
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, s...
Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner...
CSE
2010
IEEE
14 years 11 months ago
MCALab: Reproducible Research in Signal and Image Decomposition and Inpainting
Morphological Component Analysis (MCA) of signals and images is an ambitious and important goal in signal processing; successful methods for MCA have many far-reaching application...
Mohamed-Jalal Fadili, Jean-Luc Starck, Michael Ela...
TALG
2010
158views more  TALG 2010»
14 years 6 months ago
Clustering for metric and nonmetric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
Marcel R. Ackermann, Johannes Blömer, Christi...
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
15 years 12 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
FOCS
1994
IEEE
15 years 3 months ago
The Load, Capacity and Availability of Quorum Systems
A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mu...
Moni Naor, Avishai Wool