default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSara Tressens
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j8]Hernan Rey
, Leonardo Rey Vega, Jacob Benesty, Sara Tressens:
Author's reply to "comments on 'variable explicit regularization in affine projection algorithm: robustness issues and optimal choice' ". IEEE Trans. Signal Process. 58(7): 3953-3954 (2010)
2000 – 2009
- 2009
- [j7]Leonardo Rey Vega, Hernan Rey, Jacob Benesty, Sara Tressens:
A Family of Robust Algorithms Exploiting Sparsity in Adaptive Filters. IEEE Trans. Speech Audio Process. 17(4): 572-581 (2009) - [j6]Leonardo Rey Vega, Hernan Rey, Jacob Benesty, Sara Tressens:
A Fast Robust Recursive Least-Squares Algorithm. IEEE Trans. Signal Process. 57(3): 1209-1216 (2009) - 2008
- [j5]Leonardo Rey Vega, Hernan Rey, Jacob Benesty, Sara Tressens:
A New Robust Variable Step-Size NLMS Algorithm. IEEE Trans. Signal Process. 56(5): 1878-1893 (2008) - 2007
- [j4]Hernan Rey, Leonardo Rey Vega, Sara Tressens, Jacob Benesty:
Variable Explicit Regularization in Affine Projection Algorithm: Robustness Issues and Optimal Choice. IEEE Trans. Signal Process. 55(5-2): 2096-2109 (2007) - [c8]Leonardo Rey Vega, Hernan Rey, Jacob Benesty, Sara Tressens:
A stochastic model for a new robust NLMS algorithm. EUSIPCO 2007: 375-379 - [c7]Leonardo Rey Vega, Hernan Rey, Jacob Benesty, Sara Tressens:
A Robust Adaptive Filtering Algorithm Against Impulsive Noise. ICASSP (3) 2007: 1437-1440 - 2006
- [j3]Jacob Benesty, Hernan Rey, Leonardo Rey Vega, Sara Tressens:
A Nonparametric VSS NLMS Algorithm. IEEE Signal Process. Lett. 13(10): 581-584 (2006) - [c6]Hernan Rey, Leonardo Rey Vega, Sara Tressens, Jacob Benesty:
Optimum Variable Explicit Regularized Affine Projection Algorithm. ICASSP (3) 2006: 197-200 - 2005
- [c5]Leonardo Rey Vega, Sara Tressens, Hernan Rey:
Set Theoretic Adaptive filtering: Using periodogram and projections onto convex sets. EUSIPCO 2005: 1-4 - 2004
- [c4]Hernan G. Rey, Leonardo Rey Vega, Sara Tressens, Bruno Cernuschi-Frías:
Analysis of explicit regularization in affine projection algorithms: Robustness and optimal choice. EUSIPCO 2004: 1809-1812
1990 – 1999
- 1990
- [j2]Hui-Min Zhang, Pierre Duhamel, Sara Tressens:
An improved Burg-type recursive lattice method for autoregressive spectral analysis. IEEE Trans. Acoust. Speech Signal Process. 38(8): 1437-1445 (1990) - [c3]Henri Clergeot, Sara Tressens:
Comparison of two efficient ML algorithms for high resolution sources tracking-time recursive implementation. ICASSP 1990: 2963-2966
1980 – 1989
- 1989
- [j1]Henri Clergeot, Sara Tressens, Abdelaziz Ouamri:
Performance of high resolution frequencies estimation methods compared to the Cramer-Rao bounds. IEEE Trans. Acoust. Speech Signal Process. 37(11): 1703-1720 (1989) - 1988
- [c2]Sara Tressens, Henri Clergeot, Abdelaziz Ouamri, Michel Bouvet:
More on optimality of EVD methods for bearing estimation. ICASSP 1988: 2881-2884 - 1985
- [c1]Henri Clergeot, Abdelaziz Ouamri, Sara Tressens:
High resolution spectral method for spatial discrimination of closely spaced correlated sources. ICASSP 1985: 560-563
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 2024-04-24 23:08 CEST 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:
