Lu Gan 0002

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Nam H. Nguyen

> Home > Persons > Lu Gan 0002

Publications

2012
[j14]
- view
  authority control:
- export record
  dblp key:
  - journals/tsp/DoGNT12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tsp/DoGNT12
Thong T. Do, Lu Gan, Nam H. Nguyen, Trac D. Tran:
Fast and Efficient Compressive Sensing Using Structurally Random Matrices. IEEE Trans. Signal Process. 60(1): 139-154 (2012)
2011
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1106-5037
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1106-5037
Thong T. Do, Lu Gan, Nam H. Nguyen, Trac D. Tran:
Fast and Efficient Compressive Sensing using Structurally Random Matrices. CoRR abs/1106.5037 (2011)
2009
[c18]
- view
  authority control:
- export record
  dblp key:
  - conf/icassp/DoCNGT09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icassp/DoCNGT09
Thong T. Do, Yi Chen, Nam H. Nguyen, Lu Gan, Trac D. Tran:
A fast and efficient heuristic nuclear-norm algorithm for affine rank minimization. ICASSP 2009: 3393-3396
2008
[c15]
- view
  authority control:
- export record
  dblp key:
  - conf/acssc/Do0NT08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/acssc/Do0NT08
Thong T. Do, Lu Gan, Nam H. Nguyen, Trac D. Tran:
Sparsity adaptive matching pursuit algorithm for practical compressed sensing. ACSCC 2008: 581-587

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.