Sciweavers

1391 search results - page 51 / 279
» Optimally Sparse Frames
Sort
View
ICASSP
2009
IEEE
15 years 6 months ago
Robust-SL0 for stable sparse representation in noisy settings
In the last few years, we have witnessed an explosion in applications of sparse representation, the majority of which share the need for finding sparse solutions of underdetermine...
Armin Eftekhari, Massoud Babaie-Zadeh, Christian J...
ICASSP
2007
IEEE
15 years 6 months ago
Morphological Diversity and Sparse Image Denoising
Overcomplete representations are attracting interest in image processing theory, particularly due to their potential to generate sparse representations of data based on their morp...
Mohamed-Jalal Fadili, Jean-Luc Starck, Larbi Boubc...
FCCM
2007
IEEE
165views VLSI» more  FCCM 2007»
15 years 1 months ago
Sparse Matrix-Vector Multiplication Design on FPGAs
Creating a high throughput sparse matrix vector multiplication (SpMxV) implementation depends on a balanced system design. In this paper, we introduce the innovative SpMxV Solver ...
Junqing Sun, Gregory D. Peterson, Olaf O. Storaasl...
SBBD
2007
72views Database» more  SBBD 2007»
15 years 1 months ago
Similarity and Analogy over Application Domains
Abstract. Databases, particularly when storing heterogeneous, sparse semistructured data, tend to provide incomplete information and information which is difficult to categorize. T...
Simone Diniz Junqueira Barbosa, Karin Koogan Breit...
SIAMCOMP
1998
141views more  SIAMCOMP 1998»
14 years 11 months ago
Randomized Data Structures for the Dynamic Closest-Pair Problem
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
Mordecai J. Golin, Rajeev Raman, Christian Schwarz...