default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCamelia Elisei-Iliescu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c9]Cristian Lucian Stanciu, Cristian Anghel, Camelia Elisei-Iliescu:
Regularized RLS Adaptive Algorithm with Conjugate Gradient Method. SpeD 2023: 18-23- 2022
- [c8]Ionut-Dorinel Fîciu, Camelia Elisei-Iliescu, Cristian Lucian Stanciu, Constantin Paleologu, Jacob Benesty, Cristian Anghel:
An RLS Algorithm for the Identification of Impulse Responses with Particular Symmetric Properties. ECAI 2022: 1-4 - [c7]Ionut-Dorinel Fîciu, Cristian Lucian Stanciu, Camelia Elisei-Iliescu, Cristian Anghel, Radu Mihnea Udrea:
Low-Complexity Implementation of a Data-Reuse RLS Algorithm. TSP 2022: 289-293 - 2021
- [j4]Laura-Maria Dogariu, Cristian Lucian Stanciu, Camelia Elisei-Iliescu, Constantin Paleologu
, Jacob Benesty, Silviu Ciochina:
Tensor-Based Adaptive Filtering Algorithms. Symmetry 13(3): 481 (2021) - 2020
- [j3]Camelia Elisei-Iliescu, Laura-Maria Dogariu, Constantin Paleologu, Jacob Benesty, Andrei Alexandru Enescu, Silviu Ciochina:
A Recursive Least-Squares Algorithm for the Identification of Trilinear Forms. Algorithms 13(6): 135 (2020) - [c6]Camelia Elisei-Iliescu, Constantin Paleologu, Jacob Benesty, Cristian Lucian Stanciu, Cristian Anghel, Silviu Ciochina:
A Decomposition-Based RLS Algorithm with Variable Forgetting Factors. COMM 2020: 43-48 - [c5]Camelia Elisei-Iliescu, Constantin Paleologu, Jacob Benesty, Cristian Lucian Stanciu, Cristian Anghel, Silviu Ciochina:
A Multichannel Recursive Least-Squares Algorithm Based on a Kronecker Product Decomposition. TSP 2020: 14-18
2010 – 2019
- 2019
- [j2]Camelia Elisei-Iliescu, Constantin Paleologu, Jacob Benesty, Cristian Lucian Stanciu, Cristian Anghel, Silviu Ciochina:
Recursive Least-Squares Algorithms for the Identification of Low-Rank Systems. IEEE ACM Trans. Audio Speech Lang. Process. 27(5): 903-918 (2019) - [c4]Camelia Elisei-Iliescu, Constantin Paleologu, Jacob Benesty, Silviu Ciochina:
A Recursive Least-squares Algorithm Based on the Nearest Kronecker Product Decomposition. ICASSP 2019: 4843-4847 - 2018
- [j1]Camelia Elisei-Iliescu, Cristian Lucian Stanciu, Constantin Paleologu, Jacob Benesty, Cristian Anghel, Silviu Ciochina:
Efficient recursive least-squares algorithms for the identification of bilinear forms. Digit. Signal Process. 83: 280-296 (2018) - [c3]Camelia Elisei-Iliescu, Cristian Lucian Stanciu, Constantin Paleologu, Cristian Anghel, Silviu Ciochina, Jacob Benesty:
Low-Complexity RLS Algorithms for the Identification of Bilinear Forms. EUSIPCO 2018: 455-459 - [c2]Constantin Paleologu, Jacob Benesty, Camelia Elisei-Iliescu, Cristian Lucian Stanciu, Cristian Anghel, Silviu Ciochina:
A Proportionate NLMS Algorithm for the Identification of Sparse Bilinear Forms. TSP 2018: 1-5 - 2017
- [c1]Camelia Elisei-Iliescu, Cristian Lucian Stanciu, Constantin Paleologu, Jacob Benesty, Cristian Anghel, Silviu Ciochina:
Robust variable-regularized RLS algorithms. HSCMA 2017: 171-175
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-25 05:47 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:
