Norbert Goertz

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 Stefan C. Birgmeier

> Home > Persons > Norbert Goertz

Publications

2020
[c63]
- view
  - electronic edition @ ieee.org
  - no references & citations available
- export record
  dblp key:
  - conf/wsa/GoertzB20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wsa/GoertzB20
Norbert Goertz, Stefan C. Birgmeier:
Sparse Measurement Matrices for Compressed-Sensing Recovery by Bayesian Approximate Message Passing. WSA 2020: 1-6
2019
[c62]
- view
  authority control:
- export record
  dblp key:
  - conf/icassp/BirgmeierG19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icassp/BirgmeierG19
Stefan C. Birgmeier, Norbert Goertz:
Robust Approximate Message Passing for Nonzero-mean Sensing Matrices. ICASSP 2019: 4898-4902
[c61]
- view
  - electronic edition @ ieee.org
  - no references & citations available
- export record
  dblp key:
  - conf/wsa/BirgmeierG19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wsa/BirgmeierG19
Stefan C. Birgmeier, Norbert Goertz:
Approximate Message Passing for Joint Activity Detection and Decoding in Non-orthogonal CDMA. WSA 2019: 53-57
2018
[c60]
- view
  authority control:
- export record
  dblp key:
  - conf/eusipco/BirgmeierG18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/eusipco/BirgmeierG18
Stefan C. Birgmeier, Norbert Goertz:
Optimizing Approximate Message Passing for Variable Measurement Noise. EUSIPCO 2018: 484-488

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.