Sciweavers

416 search results - page 2 / 84
» Simple and Efficient Algorithm for Approximate Dictionary Ma...
Sort
View
ICASSP
2009
IEEE
13 years 11 months ago
A low complexity Orthogonal Matching Pursuit for sparse signal approximation with shift-invariant dictionaries
We propose a variant of Orthogonal Matching Pursuit (OMP), called LoCOMP, for scalable sparse signal approximation. The algorithm is designed for shift-invariant signal dictionari...
Boris Mailhé, Rémi Gribonval, Fr&eac...
ACISICIS
2008
IEEE
13 years 6 months ago
Efficient Projection for Compressed Sensing
Compressed sensing (CS), a joint compression and sensing process, is a emerging field of activity in which the signal is sampled and simultaneously compressed at a greatly reduced...
Vo Dinh Minh Nhat, Duc Vo, Subhash Challa, Sungyou...
SPIRE
1998
Springer
13 years 9 months ago
Fast Approximate String Matching in a Dictionary
A successful technique to search large textual databases allowing errors relies on an online search in the vocabulary of the text. To reduce the time of that online search, we ind...
Ricardo A. Baeza-Yates, Gonzalo Navarro
DCC
2005
IEEE
14 years 4 months ago
Progressive Low Bit Rate Coding of Simple 3D Objects with Matching Pursuit
This paper presents a low rate progressive 3D mesh compression scheme for simple genuszero 3D objects. The proposed scheme is based on signal representation using redundant expans...
Ivana Tosic, Pascal Frossard, Pierre Vandergheynst
STOC
2007
ACM
104views Algorithms» more  STOC 2007»
14 years 5 months ago
Simple deterministic approximation algorithms for counting matchings
Mohsen Bayati, David Gamarnik, Dimitriy A. Katz, C...