default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRenato Candido
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Daniel G. Tiglea
, Renato Candido, Magno T. M. Silva:
Adaptive diffusion networks: An overview. Signal Process. 223: 109570 (2024)- [j7]Daniel G. Tiglea, Renato Candido, Magno T. M. Silva:
On the Impact of Random Node Sampling on Adaptive Diffusion Networks. IEEE Trans. Signal Process. 72: 3973-3989 (2024) - 2023
- [c9]Daniel G. Tiglea, Renato Candido, Luis Antonio Azpicueta-Ruiz, Magno T. M. Silva:
Reducing the Communication and Computational Cost of Random Fourier Features Kernel LMS in Diffusion Networks. ICASSP 2023: 1-5 - [c8]Daniel G. Tiglea, Renato Candido, Magno T. M. Silva:
Can Adaptive Diffusion Networks Do Better with Less Data? ISWCS 2023: 1-6 - 2022
- [j6]Daniel G. Tiglea, Renato Candido, Magno T. M. Silva:
An adaptive algorithm for sampling over diffusion networks with dynamic parameter tuning and change detection mechanisms. Digit. Signal Process. 127: 103587 (2022) - [j5]Daniel G. Tiglea, Renato Candido, Magno T. M. Silva:
A Variable Step Size Adaptive Algorithm With Simple Parameter Selection. IEEE Signal Process. Lett. 29: 1774-1778 (2022) - 2021
- [j4]Daniel G. Tiglea, Renato Candido, Magno T. M. Silva:
A Low-Cost Algorithm for Adaptive Sampling and Censoring in Diffusion Networks. IEEE Trans. Signal Process. 69: 58-72 (2021) - 2020
- [c7]Daniel G. Tiglea, Renato Candido, Magno T. M. Silva:
A Sampling Algorithm for Diffusion Networks. EUSIPCO 2020: 2175-2179
2010 – 2019
- 2019
- [c6]Daniel G. Tiglea, Renato Candido, Magno T. M. Silva:
An Adaptive Sampling Technique for Graph Diffusion LMS Algorithm. EUSIPCO 2019: 1-5 - 2018
- [c5]Magno T. M. Silva, Renato Candido, Jerónimo Arenas-García, Luis Antonio Azpicueta-Ruiz:
Improving Multikernel Adaptive Filtering with Selective Bias. ICASSP 2018: 4529-4533 - 2015
- [j3]Renato Candido, Diogo C. Soriano, Magno T. M. Silva, Marcio Eisencraft:
Do chaos-based communication systems really transmit chaotic signals? Signal Process. 108: 412-420 (2015) - 2014
- [j2]Renato Candido, Marcio Eisencraft, Magno T. M. Silva:
Channel equalization for synchronization of chaotic maps. Digit. Signal Process. 33: 42-49 (2014) - 2013
- [c4]Renato Candido, Marcio Eisencraft, Magno T. M. Silva:
Channel equalization for synchronization of Ikeda maps. EUSIPCO 2013: 1-5 - 2010
- [j1]Renato Candido, Magno T. M. Silva, Vítor H. Nascimento:
Transient and steady-state analysis of the affine combination of two adaptive filters. IEEE Trans. Signal Process. 58(8): 4064-4078 (2010) - [c3]Renato Candido, Magno T. M. Silva, Maria D. Miranda, Vítor H. Nascimento:
A statistical analysis of the dual-mode CMA. ISCAS 2010: 2510-2513
2000 – 2009
- 2009
- [c2]Renato Candido, Magno T. M. Silva, Vítor H. Nascimento:
On combinations of CMA equalizers. ICASSP 2009: 2865-2868 - 2008
- [c1]Renato Candido, Magno T. M. Silva, Vítor H. Nascimento:
Affine combinations of adaptive filters. ACSCC 2008: 236-240
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-09-21 23:41 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:
