Federico Penna

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 Vladimir Savic

> Home > Persons > Federico Penna

Publications

2013
[c20]
- view
  authority control:
- export record
  dblp key:
  - conf/icc/WymeerschPSZ13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icc/WymeerschPSZ13
Henk Wymeersch, Federico Penna, Vladimir Savic, Jun Zhao:
Comparison of reweighted message passing algorithms for LDPC decoding. ICC 2013: 3264-3269
2012
[j6]
- view
  authority control:
- export record
  dblp key:
  - journals/twc/WymeerschPS12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/twc/WymeerschPS12
Henk Wymeersch, Federico Penna, Vladimir Savic:
Uniformly Reweighted Belief Propagation for Estimation and Detection in Wireless Networks. IEEE Trans. Wirel. Commun. 11(4): 1587-1595 (2012)
2011
[c10]
- view
  authority control:
- export record
  dblp key:
  - conf/icassp/SavicWPZ11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icassp/SavicWPZ11
Vladimir Savic, Henk Wymeersch, Federico Penna, Santiago Zazo:
Optimized edge appearance probability for cooperative localization based on tree-reweighted nonparametric belief propagation. ICASSP 2011: 3028-3031
[c8]
- view
  authority control:
- export record
  dblp key:
  - conf/isit/WymeerschPS11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isit/WymeerschPS11
Henk Wymeersch, Federico Penna, Vladimir Savic:
Uniformly reweighted belief propagation: A factor graph approach. ISIT 2011: 2000-2004

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.