V. G. Reju

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 Anh H. T. Nguyen

> Home > Persons > V. G. Reju

Publications

2020
[j11]
- view
  authority control:
- export record
  dblp key:
  - journals/tsp/NguyenRK20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tsp/NguyenRK20
Anh H. T. Nguyen, Vaninirappuputhenpurayil Gopalan Reju, Andy W. H. Khong:
Directional Sparse Filtering for Blind Estimation of Under-Determined Complex-Valued Mixing Matrices. IEEE Trans. Signal Process. 68: 1990-2003 (2020)
2019
[c14]
- view
  authority control:
- export record
  dblp key:
  - conf/icassp/NguyenRK19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icassp/NguyenRK19
Anh H. T. Nguyen, V. G. Reju, Andy W. H. Khong:
A Method Based on L-bfgs to Solve Constrained Complex-valued Ica. ICASSP 2019: 4370-4374
2018
[c13]
- view
  authority control:
- export record
  dblp key:
  - conf/iwaenc/RejuRNK18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iwaenc/RejuRNK18
V. G. Reju, Rajan S. Rashobh, Anh H. T. Nguyen, Andy W. H. Khong:
An Efficient Multi-Source DOA Estimation Algorithm for Underdetermined System. IWAENC 2018: 86-90
2017
[c12]
- view
  authority control:
- export record
  dblp key:
  - conf/icassp/NguyenRKS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icassp/NguyenRKS17
Anh H. T. Nguyen, V. G. Reju, Andy W. H. Khong, Ing Yann Soon:
Learning complex-valued latent filters with absolute cosine similarity. ICASSP 2017: 2412-2416

a service of

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.