416 search results - page 6 / 84 » Simple and Efficient Algorithm for Approximate Dictionary Ma... |
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = (V, E) with n vertices...
SODA
2000
ACM
13 years 9 months ago
2000
ACM
In this note we describe a general technique for making treestructured dynamic dictionaries adapt to be competitive with the most efficient implementation, by using potential ener...
ICASSP
2009
IEEE
14 years 2 months ago
2009
IEEE
When sampling signals below the Nyquist rate, efficient and accurate reconstruction is nevertheless possible, whenever the sampling system is well behaved and the signal is well ...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
This article extends the concept of compressed sensing to signals that are not sparse in an orthonormal basis but rather in a redundant dictionary. It is shown that a matrix, whic...
ICIP
2010
IEEE
13 years 5 months ago
2010
IEEE
In this paper, an automatic target recognition algorithm is presented based on a framework for learning dictionaries for simultaneous sparse signal representation and feature extr...