587 search results - page 23 / 118 » Theory of matching pursuit |
ICIP
2009
IEEE
13 years 5 months ago
2009
IEEE
Leading compressed sensing (CS) methods require m = O (k log(n)) compressive samples to perfectly reconstruct a k-sparse signal x of size n using random projection matrices (e.g., ...
TSP
2010
13 years 2 months ago
2010
Abstract--In this paper, we investigate various channel estimators that exploit channel sparsity in the time and/or Doppler domain for a multicarrier underwater acoustic system. We...
PAMI
2011
12 years 10 months ago
2011
Abstract—In this paper, we define meta-recognition, a performance prediction method for recognition algorithms, and examine the theoretical basis for its post-recognition score ...
DGO
2006
13 years 8 months ago
2006
A sea of undifferentiated information is forming from the body of data that is collected by people and organizations, across government, for different purposes, at different times...
COMBINATORICS
1999
13 years 7 months ago
1999
This is a continuation of our paper "A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating...