default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCristian Lucian Stanciu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Cristian Lucian Stanciu
, Jacob Benesty, Constantin Paleologu, Ruxandra-Liana Costea, Laura-Maria Dogariu, Silviu Ciochina:
Decomposition-Based Wiener Filter Using the Kronecker Product and Conjugate Gradient Method. IEEE ACM Trans. Audio Speech Lang. Process. 32: 124-138 (2024)- [c23]Cristian Lucian Stanciu, Bogdan Ionescu, Luca Cuccovillo, Symeon Papadopoulos, Giorgos Kordopatis-Zilos, Adrian Popescu, Roberto Caldelli:
MAD '24 Workshop: Multimedia AI against Disinformation. ICMR 2024: 1339-1341 - [e1]Cristian Lucian Stanciu, Luca Cuccovillo, Bogdan Ionescu, Giorgos Kordopatis-Zilos, Symeon Papadopoulos, Adrian Popescu, Roberto Caldelli:
Proceedings of the 3rd ACM International Workshop on Multimedia AI against Disinformation, MAD 2024, Phuket, Thailand, June 10-14, 2024. ACM 2024 [contents] - 2023
- [j7]Constantin Paleologu, Jacob Benesty, Cristian Lucian Stanciu, Jesper Rindom Jensen, Mads Græsbøll Christensen, Silviu Ciochina:
Recursive least-squares algorithm based on a third-order tensor decomposition for low-rank system identification. Signal Process. 213: 109216 (2023) - [c22]Laura-Maria Dogariu, Constantin Paleologu, Jacob Benesty, Cristian Lucian Stanciu, Silviu Ciochina:
A Decomposition-Based Kalman Filter for the Identification of Acoustic Impulse Responses. EUSIPCO 2023: 351-355 - [c21]Cristian Lucian Stanciu, Cristian Anghel, Camelia Elisei-Iliescu:
Regularized RLS Adaptive Algorithm with Conjugate Gradient Method. SpeD 2023: 18-23 - 2022
- [c20]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 - [c19]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
- [j6]Laura-Maria Dogariu, Constantin Paleologu, Jacob Benesty, Cristian Lucian Stanciu, Claudia Cristina Oprea, Silviu Ciochina:
A Kalman Filter for Multilinear Forms and Its Connection with Tensorial Adaptive Filters. Sensors 21(10): 3555 (2021) - [j5]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) - [c18]Cristian Anghel, Cristian Lucian Stanciu, Constantin Paleologu:
A practical controlled NLMS algorithm for network echo cancellation. BlackSeaCom 2021: 1-5 - [c17]Ciprian Dragoi, Cristian Anghel, Cristian Lucian Stanciu, Constantin Paleologu:
Efficient FPGA Implementation of Classic Audio Effects. ECAI 2021: 1-6 - 2020
- [c16]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 - [c15]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
- [j4]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) - 2018
- [j3]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) - [c14]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 - [c13]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
- [j2]Cristian Anghel, Cristian Lucian Stanciu, Constantin Paleologu:
LTE Turbo Decoding Parallel Architecture with Single Interleaver Implemented on FPGA. Circuits Syst. Signal Process. 36(4): 1455-1475 (2017) - [c12]Roxana Mihaescu, Cristian Lucian Stanciu, Constantin Paleologu:
On the Regularization of the Memory-Improved Proportionate Affine Projection Algorithm. FABULOUS 2017: 151-157 - [c11]Camelia Elisei-Iliescu, Cristian Lucian Stanciu, Constantin Paleologu, Jacob Benesty, Cristian Anghel, Silviu Ciochina:
Robust variable-regularized RLS algorithms. HSCMA 2017: 171-175 - 2016
- [c10]Constantin Paleologu, Jacob Benesty, Cristian Lucian Stanciu, Cristian Anghel, Mircea Stenta:
Robust regularization of the recursive least-squares algorithm. ECAI 2016: 1-4 - [c9]Lucian Stanciu, Valentin Stanciu, Cristian Lucian Stanciu:
Grouped B-spline windows for the design of modulated filter banks. COMM 2016: 21-24 - [c8]Cristian Lucian Stanciu, Cristian Anghel, Constantin Paleologu, Silviu Ciochina, Jacob Benesty:
On the numerical properties of an optimized NLMS algorithm. COMM 2016: 25-28 - [c7]Radu Mihnea Udrea, Claudia Cristina Oprea, Cristian Lucian Stanciu:
Multi-microphone Noise Reduction System Integrating Nonlinear Multi-band Spectral Subtraction. MindCare/Fabulous 2016: 133-138 - 2014
- [c6]Cristian Lucian Stanciu, Cristian Anghel:
Numerical properties of the DCD-RLS algorithm for stereo acoustic echo cancellation. COMM 2014: 1-4 - [c5]Lucian Stanciu, Cristian Lucian Stanciu, Valentin Stanciu:
Spline polynomial approach for the design of quadrature mirror filters. COMM 2014: 1-4 - 2013
- [j1]Cristian Lucian Stanciu, Jacob Benesty, Constantin Paleologu, Tomas Gänsler, Silviu Ciochina:
A widely linear model for stereophonic acoustic echo cancellation. Signal Process. 93(2): 511-516 (2013) - 2012
- [c4]Cristian Lucian Stanciu, Constantin Paleologu, Jacob Benesty, Silviu Ciochina, Felix Albu:
Variable-forgetting factor RLS for stereophonic acoustic echo cancellation with widely linear model. EUSIPCO 2012: 1960-1964 - [c3]Cristian Lucian Stanciu, Jacob Benesty, Constantin Paleologu, Tomas Gänsler, Silviu Ciochina:
A novel perspective on stereophonic acoustic echo cancellation. ICASSP 2012: 25-28 - [c2]Lucian Stanciu, Cristian Lucian Stanciu:
Optimum digital audio equalizers with flat frequency response. COMM 2012: 55-58 - 2011
- [c1]Cristian Lucian Stanciu, Cristian Anghel, Constantin Paleologu, Jacob Benesty, Felix Albu, Silviu Ciochina:
FPGA implementation of an efficient proportionate affine projection algorithm for echo cancellation. EUSIPCO 2011: 1284-1288
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-06-19 21:00 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:
