Alexander Bertrand

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 Charles Hovine

> Home > Persons > Alexander Bertrand

Publications

2023
[j53]
- view
  authority control:
- export record
  dblp key:
  - journals/tsp/MusluogluHB23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tsp/MusluogluHB23
Cem Ates Musluoglu, Charles Hovine, Alexander Bertrand:
A Unified Algorithmic Framework for Distributed Adaptive Signal and Feature Fusion Problems - Part II: Convergence Properties. IEEE Trans. Signal Process. 71: 1879-1894 (2023)
[c58]
- view
  authority control:
- export record
  dblp key:
  - conf/icassp/HovineB23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icassp/HovineB23
Charles Hovine, Alexander Bertrand:
A Distributed Adaptive Algorithm for Non-Smooth Spatial Filtering Problems. ICASSP 2023: 1-5
2022
[j49]
- view
  authority control:
- export record
  dblp key:
  - journals/tsp/HovineB22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tsp/HovineB22
Charles Hovine, Alexander Bertrand:
MAXVAR-Based Distributed Correlation Estimation in a Wireless Sensor Network. IEEE Trans. Signal Process. 70: 5533-5548 (2022)
2021
[c51]
- view
  authority control:
- export record
  dblp key:
  - conf/eusipco/HovineB21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/eusipco/HovineB21
Charles Hovine, Alexander Bertrand:
Distributed MAXVAR: Identifying Common Signal Components across the Nodes of a Sensor Network. EUSIPCO 2021: 2159-2163

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.