default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFlorence Alberge
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Eduardo Dadalto Câmara Gomes, Florence Alberge, Pierre Duhamel, Pablo Piantanida:
Combine and Conquer: A Meta-Analysis on Data Shift and Out-of-Distribution Detection. Trans. Mach. Learn. Res. 2024 (2024)- [c31]Maxime Ossonce, Pierre Duhamel, Florence Alberge:
Adequate Structuring of the Latent Space for Easy Classification and Out-of-Distribution Detection. EUSIPCO 2024: 1776-1780 - [c30]Andrés Altieri, Marco Romanelli, Georg Pichler, Florence Alberge, Pablo Piantanida:
Beyond the Norms: Detecting Prediction Errors in Regression Models. ICML 2024 - [i7]Andrés Altieri, Marco Romanelli, Georg Pichler, Florence Alberge, Pablo Piantanida:
Beyond the Norms: Detecting Prediction Errors in Regression Models. CoRR abs/2406.06968 (2024) - [i6]Eduardo Dadalto, Florence Alberge, Pierre Duhamel, Pablo Piantanida:
Combine and Conquer: A Meta-Analysis on Data Shift and Out-of-Distribution Detection. CoRR abs/2406.16045 (2024) - 2022
- [c29]Maxime Ossonce, Florence Alberge, Pierre Duhamel
:
Joint Classification and out-of-Distribution Detection Based on Structured Latent Space of Variational Auto-Encoders. ICIP 2022: 1201-1205 - [c28]Eduardo Dadalto Câmara Gomes, Florence Alberge, Pierre Duhamel, Pablo Piantanida:
Igeood: An Information Geometry Approach to Out-of-Distribution Detection. ICLR 2022 - [i5]Eduardo Dadalto Câmara Gomes, Florence Alberge, Pierre Duhamel, Pablo Piantanida:
Igeood: An Information Geometry Approach to Out-of-Distribution Detection. CoRR abs/2203.07798 (2022)
2010 – 2019
- 2019
- [j12]Florence Alberge:
Deep Learning Constellation Design for the AWGN Channel With Additive Radar Interference. IEEE Trans. Commun. 67(2): 1413-1423 (2019) - [c27]Florence Alberge, Clément Feutry, Pierre Duhamel, Pablo Piantanida:
Detecting Covariate Shift with Black Box Predictors. ICT 2019: 324-329 - 2018
- [c26]Florence Alberge:
Constellation design with deep learning for downlink non-orthogonal multiple access. PIMRC 2018: 1-5 - 2016
- [j11]Zeina Mheich, Maël Le Treust, Florence Alberge, Pierre Duhamel:
Rate Adaptation for Incremental Redundancy Secure HARQ. IEEE Trans. Commun. 64(2): 765-777 (2016) - [c25]Florence Alberge:
Min-Sum decoding of irregular LDPC codes with adaptive scaling based on mutual information. ISTC 2016: 71-75 - [c24]Mohieddine El Soussi, Thang X. Vu, Hong N. Nguyen, Pierre Duhamel, Florence Alberge, Luc Vandendorpe:
Semi-orthogonal MARC with half duplex relaying: A backward compatible cooperative network with interference channels. SPAWC 2016: 1-5 - 2015
- [b1]Florence Alberge:
Méthodes de codage et d'estimation adaptative appliquées aux communications sans fil. University of Paris-Sud, Orsay, France, 2015 - [j10]Zeina Mheich, Florence Alberge, Pierre Duhamel:
Achievable Secrecy Rates for the Broadcast Channel With Confidential Message and Finite Constellation Inputs. IEEE Trans. Commun. 63(1): 195-205 (2015) - [j9]Florence Alberge:
On Some Properties of the Mutual Information Between Extrinsics With Application to Iterative Decoding. IEEE Trans. Commun. 63(5): 1541-1553 (2015) - 2014
- [c23]Zeina Mheich, Maël Le Treust, Florence Alberge, Pierre Duhamel, Leszek Szczecinski:
Rate-adaptive secure HARQ protocol for block-fading channels. EUSIPCO 2014: 830-834 - [c22]Zeina Mheich, Florence Alberge, Pierre Duhamel:
The impact of finite-alphabet input on the secrecy-achievable rates for broadcast channel with confidential message. ICASSP 2014: 5705-5709 - [i4]Zeina Mheich, Florence Alberge, Pierre Duhamel:
On the efficiency of transmission strategies for broadcast channels using finite size constellations. CoRR abs/1403.2702 (2014) - 2013
- [j8]Zeina Mheich, Florence Alberge, Pierre Duhamel:
Achievable rates optimization for broadcast channels using finite size constellations under transmission constraints. EURASIP J. Wirel. Commun. Netw. 2013: 254 (2013) - [j7]Florence Alberge, Ziad Naja, Pierre Duhamel:
Power Extrinsic Propagation for Turbo-Codes. IEEE Trans. Signal Process. 61(5): 1107-1111 (2013) - [c21]Zeina Mheich, Florence Alberge, Pierre Duhamel:
On the efficiency of transmission strategies for broadcast channels using finite size constellations. EUSIPCO 2013: 1-5 - 2012
- [c20]Pierre Gerold, Thi-Thuy-Ngoc Pham, Florence Alberge, Pierre Duhamel:
Multi-hop, multi-route power minimisation in ad hoc network. ICASSP 2012: 3213-3216 - [c19]Florence Alberge:
Pairwise joint probability propagation in BICM-ID. ISTC 2012: 6-10 - 2011
- [c18]Florence Alberge:
A game-theoretic interpretation of iterative decoding. EUSIPCO 2011: 76-80 - [c17]Florence Alberge, Ziad Naja, Pierre Duhamel:
From maximum likelihood to iterative decoding. ICASSP 2011: 3052-3055 - 2010
- [c16]Xu Zhe, Yongsheng Wang, Florence Alberge, Pierre Duhamel:
A turbo iteration algorithm in 16QAM hierarchical modulation. WCNIS 2010: 9-12 - [i3]Ziad Naja, Florence Alberge, Pierre Duhamel:
Méthode du point proximal: principe et applications aux algorithmes itératifs. CoRR abs/1001.1912 (2010) - [i2]Ziad Naja, Florence Alberge, Pierre Duhamel:
Geometrical interpretation and improvements of the Blahut-Arimoto's algorithm. CoRR abs/1001.1915 (2010) - [i1]Florence Alberge, Ziad Naja, Pierre Duhamel:
New Criteria for Iterative Decoding. CoRR abs/1001.1917 (2010)
2000 – 2009
- 2009
- [c15]Florence Alberge, Ziad Naja, Pierre Duhamel:
New criteria for iterative decoding. ICASSP 2009: 2493-2496 - [c14]Ziad Naja, Florence Alberge, Pierre Duhamel:
Geometrical interpretation and improvements of the Blahut-Arimoto's algorithm. ICASSP 2009: 2505-2508 - 2008
- [j6]Fatma Abdelkefi, Pierre Duhamel, Florence Alberge, Jaouhar Ayadi:
On the use of cascade structure to correct impulsive noise in multicarrier systems. IEEE Trans. Commun. 56(11): 1844-1858 (2008) - [c13]Florence Alberge:
Iterative decoding as Dykstra's algorithm with alternate I-projection and reverse I-projection. EUSIPCO 2008: 1-5 - 2007
- [j5]Fatma Abdelkefi, Pierre Duhamel, Florence Alberge:
A Necessary Condition on the Location of Pilot Tones for Maximizing the Correction Capacity in OFDM Systems. IEEE Trans. Commun. 55(2): 356-366 (2007) - [c12]Florence Alberge:
Accelerated Linear EM-MAP Algorithm for OFDM Channel Estimation. ICASSP (3) 2007: 269-272 - 2006
- [j4]Florence Alberge, Mila Nikolova, Pierre Duhamel:
Blind identification/equalization using deterministic maximum likelihood and a partial prior on the input. IEEE Trans. Signal Process. 54(2): 724-737 (2006) - [c11]Jean-Marcel Mamfoumbi-Ocloo, Florence Alberge:
OFDM Channel Estimation by a Linear EM-Map Algorithm. ICASSP (4) 2006: 109-112 - 2005
- [j3]Fatma Abdelkefi, Pierre Duhamel, Florence Alberge:
Impulsive noise cancellation in multicarrier transmission. IEEE Trans. Commun. 53(1): 94-106 (2005) - 2004
- [c10]Sami Touati, Jean-Marcel Mamfoumbi-Ocloo, Pierre Duhamel, Florence Alberge:
Semi-blind channel estimation for OFDM systems via an EM-Block algorithm. EUSIPCO 2004: 2079-2082 - [c9]Rafael Gallego, Alexandre Rouxel, Florence Alberge, Pierre Duhamel:
Semi-blind equalization for GMSK-based mobile communications. ICASSP (4) 2004: 861-864 - 2003
- [c8]Fatma Abdelkefi, Pierre Duhamel, Florence Alberge:
A necessary condition on the location of pilot tones for impulse noise cancellation in OFDM system and its applications in Hiperlan2. GLOBECOM 2003: 883-887 - [c7]Fatma Abdelkefi, Pierre Duhamel, Florence Alberge:
Impulse noise correction in Hiperlan 2: improvement of the decoding algorithm and application to PAPR reduction. ICC 2003: 2094-2098 - [c6]Fatma Abdelkefi, Pierre Duhamel, Florence Alberge:
Improvement of the complex Reed Solomon decoding with application to impulse noise cancellation in Hiperlan2. ISSPA (2) 2003: 387-390 - 2002
- [j2]Florence Alberge, Pierre Duhamel, Mila Nikolova:
Adaptive solution for blind identification/equalization using deterministic maximum likelihood. IEEE Trans. Signal Process. 50(4): 923-936 (2002) - [c5]Fatma Abdelkefi, Pierre Duhamel, Florence Alberge:
A posteriori control of complex Reed Solomon decoding with application to impulse noise cancellation in HIPERLAN/2. ICC 2002: 659-663 - 2001
- [c4]Fatma Abdelkefi, Pierre Duhamel, Florence Alberge:
On the use of pilot tones for impulse noise cancellation in Hiperlan2. ISSPA 2001: 591-594 - 2000
- [c3]Florence Alberge, Pierre Duhamel, Mila Nikolova:
Low cost adaptive algorithm for blind channel identification and symbol estimation. EUSIPCO 2000: 1-4 - [c2]Florence Alberge, Mila Nikolova, Pierre Duhamel:
Adaptive deterministic maximum likelihood using a quasi-discrete prior. ICASSP 2000: 2745-2748
1990 – 1999
- 1998
- [j1]Jean Pierre Delmas, Florence Alberge:
Asymptotic performance analysis of subspace adaptive algorithms introduced in the neural network literature. IEEE Trans. Signal Process. 46(1): 170-182 (1998) - [c1]Florence Alberge, Pierre Duhamel, Yves Grenier:
A combined FDAF/WSAF algorithm for stereophonic acoustic echo cancellation. ICASSP 1998: 1413-1416
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 22:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
