416 search results - page 3 / 84 » Simple and Efficient Algorithm for Approximate Dictionary Ma... |
CPM
1998
Springer
13 years 9 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
TSP
2008
13 years 5 months ago
2008
This article introduces the concept of sensing dictionaries. It presents an alteration of greedy algorithms like thresholding or (Orthogonal) Matching Pursuit which improves their...
ICML
2010
IEEE
13 years 6 months ago
2010
IEEE
We develop an efficient learning framework to construct signal dictionaries for sparse representation by selecting the dictionary columns from multiple candidate bases. By sparse,...
WEA
2007
Springer
13 years 11 months ago
2007
Springer
We present a systematic study of approximation algorithms for the maximum weight matching problem. This includes a new algorithm which provides the simple greedy method with a rece...
ICIP
2002
IEEE
14 years 7 months ago
2002
IEEE
Matching Pursuit decomposes a signal into a linear expansion of functions selected from a redundant dictionary, isolating the signal structures that are coherent with respect to a...