Demba E. Ba

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 Berkin Bilgic

> Home > Persons > Demba E. Ba

Publications

2022
[j14]
- view
  authority control:
- export record
  dblp key:
  - journals/tsp/LinSBB22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tsp/LinSBB22
Alexander Lin, Andrew H. Song, Berkin Bilgic, Demba E. Ba:
Covariance-Free Sparse Bayesian Learning. IEEE Trans. Signal Process. 70: 3818-3831 (2022)
[c22]
- view
  authority control:
- export record
  dblp key:
  - conf/icassp/LinSBB22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icassp/LinSBB22
Alexander Lin, Andrew H. Song, Berkin Bilgic, Demba E. Ba:
High-Dimensional Sparse Bayesian Learning without Covariance Matrices. ICASSP 2022: 1511-1515
[i23]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2202-12808
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2202-12808
Alexander Lin, Andrew H. Song, Berkin Bilgic, Demba E. Ba:
High-Dimensional Sparse Bayesian Learning without Covariance Matrices. CoRR abs/2202.12808 (2022)
2021
[i17]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2105-10439
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2105-10439
Alexander Lin, Andrew H. Song, Berkin Bilgic, Demba E. Ba:
Covariance-Free Sparse Bayesian Learning. CoRR abs/2105.10439 (2021)

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.