default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHamed Yazdanpanah
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c17]Hamed Yazdanpanah, Ana Clara Teixeira, Vaishali Marar, Aline Pezente, Mohammad M. Ghassemi:
Data Selective NLMS Outperforms LSTM and Futures for Regional Soybean Prices Forecasting. EUSIPCO 2024: 696-700- 2023
- [c16]Ana Clara Teixeira
, Hamed Yazdanpanah, Aline Pezente, Mohammad M. Ghassemi:
Bayesian Networks Improve Out-of-Distribution Calibration for Agribusiness Delinquency Risk Assessment. ICAIF 2023: 244-252 - [c15]Ana Clara Teixeira, Vaishali Marar, Hamed Yazdanpanah, Aline Pezente, Mohammad M. Ghassemi:
Enhancing Credit Risk Reports Generation using LLMs: An Integration of Bayesian Networks and Labeled Guide Prompting. ICAIF 2023: 340-348 - 2022
- [i3]Hamed Yazdanpanah, Augusto C. M. Silva, Murilo Guedes, Hugo M. P. Morales, Leandro dos Santos Coelho, Fernando G. Moro:
Clinical Deterioration Prediction in Brazilian Hospitals Based on Artificial Neural Networks and Tree Decision Models. CoRR abs/2212.08975 (2022) - 2021
- [j8]Hamed Yazdanpanah, José Antonio Apolinário:
The Extended Feature LMS Algorithm: Exploiting Hidden Sparsity for Systems with Unknown Spectrum. Circuits Syst. Signal Process. 40(1): 174-192 (2021) - [j7]Mohsen Kazemnia Khakhki, Peyman Poor Moghaddam, Hamed Yazdanpanah, Webe João Mansur:
High-resolution time-frequency hilbert transform using sparsity-aware weighting function. Earth Sci. Informatics 14(3): 1197-1212 (2021) - [j6]Markus V. S. Lima, Paulo S. R. Diniz, Hamed Yazdanpanah:
Set-Membership Constrained Frequency-Domain Algorithm. IEEE Trans. Circuits Syst. II Express Briefs 68(2): 797-801 (2021) - [i2]Maryam Hosseini, Iago Breno Araujo, Hamed Yazdanpanah, Eric K. Tokuda, Fabio Miranda, Cláudio T. Silva, Roberto M. Cesar Jr.:
Sidewalk Measurements from Satellite Images: Preliminary Findings. CoRR abs/2112.06120 (2021) - 2020
- [j5]Hamed Yazdanpanah, Paulo S. R. Diniz, Markus V. S. Lima:
Improved simple set-membership affine projection algorithm for sparse system modelling: Analysis and implementation. IET Signal Process. 14(2): 81-88 (2020) - [j4]Hamed Yazdanpanah, Paulo S. R. Diniz, Markus V. S. Lima:
Feature Adaptive Filtering: Exploiting Hidden Sparsity. IEEE Trans. Circuits Syst. I Regul. Pap. 67-I(7): 2358-2371 (2020) - [c14]Alberto Carini, Markus V. S. Lima, Hamed Yazdanpanah, Simone Orcioni, Stefania Cecchi:
A Variable Step-Size for Sparse Nonlinear Adaptive Filters. EUSIPCO 2020: 2383-2387 - [c13]Hamed Yazdanpanah:
Feature Affine Projection Algorithms. ICASSP 2020: 5465-5469
2010 – 2019
- 2019
- [j3]Hamed Yazdanpanah, Paulo S. R. Diniz, Markus V. S. Lima:
Low-Complexity Feature Stochastic Gradient Algorithm for Block-Lowpass Systems. IEEE Access 7: 141587-141593 (2019) - [c12]Hamed Yazdanpanah, José Antonio Apolinário:
Feature Normalized Lms Algorithms. ACSSC 2019: 806-809 - [c11]Gabriel S. Chaves, Markus V. S. Lima, Hamed Yazdanpanah, Paulo S. R. Diniz, Tadeu N. Ferreira:
A Simple Sparsity-aware Feature LMS Algorithm. EUSIPCO 2019: 1-5 - [c10]Paulo S. R. Diniz, Hamed Yazdanpanah, Markus V. S. Lima:
Feature LMS Algorithm for Bandpass System Models. EUSIPCO 2019: 1-5 - [c9]Hamed Yazdanpanah, Alberto Carini, Markus V. S. Lima:
L0-Norm Adaptive Volterra Filters. EUSIPCO 2019: 1-5 - [c8]José Antonio Apolinário, Hamed Yazdanpanah, A. S. Nascimento, Marcello L. R. de Campos:
A Data-selective LS Solution to TDOA-based Source Localization. ICASSP 2019: 4400-4404 - [d1]José Antonio Apolinário, Hamed Yazdanpanah, Antonio Nascimento, Marcello L. R. de Campos:
A DATA-SELECTIVE LS SOLUTION TO TDOA-BASED SOURCE LOCALIZATION. IEEE DataPort, 2019
- [i1]Hamed Yazdanpanah:
On Data-Selective Learning. CoRR abs/1909.03891 (2019) - 2018
- [c7]Hamed Yazdanpanah, José Antonio Apolinário, Paulo S. R. Diniz, Markus V. S. Lima:
l0-Norm Feature LMS Algorithms. GlobalSIP 2018: 311-315 - [c6]Paulo S. R. Diniz, Hamed Yazdanpanah, Markus V. S. Lima:
Feature LMS Algorithms. ICASSP 2018: 4144-4148 - 2017
- [j2]Hamed Yazdanpanah, Markus V. S. Lima, Paulo S. R. Diniz:
On the robustness of set-membership adaptive filtering algorithms. EURASIP J. Adv. Signal Process. 2017: 72 (2017) - [j1]Hamed Yazdanpanah, Paulo S. R. Diniz:
New Trinion and Quaternion Set-Membership Affine Projection Algorithms. IEEE Trans. Circuits Syst. II Express Briefs 64-II(2): 216-220 (2017) - [c5]Paulo S. R. Diniz, Hamed Yazdanpanah:
Data censoring with set-membership algorithms. GlobalSIP 2017: 121-125 - [c4]Hamed Yazdanpanah, Paulo S. R. Diniz:
Recursive Least-Squares algorithms for sparse system modeling. ICASSP 2017: 3879-3883 - 2016
- [c3]Hamed Yazdanpanah, Paulo S. R. Diniz, Markus V. S. Lima:
A simple set-membership affine projection algorithm for sparse system modeling. EUSIPCO 2016: 1798-1802 - [c2]Paulo S. R. Diniz, Hamed Yazdanpanah:
Improved set-membership partial-update affine projection algorithm. ICASSP 2016: 4174-4178 - [c1]Hamed Yazdanpanah, Markus V. S. Lima, Paulo S. R. Diniz:
On the robustness of the set-membership NLMS algorithm. SAM 2016: 1-5
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-11-06 21:31 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:
