default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPhilippe Lemmerling
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
[j15]B. De Neuter, Jan Luts, Leentje Vanhamme, Philippe Lemmerling, Sabine Van Huffel:
Java-based framework for processing and displaying short-echo-time magnetic resonance spectroscopy signals. Comput. Methods Programs Biomed. 85(2): 129-137 (2007)- 2006
- [j14]M. Schuermans, Philippe Lemmerling, Sabine Van Huffel:
Block-row Hankel weighted low rank approximation. Numer. Linear Algebra Appl. 13(4): 293-302 (2006) - [j13]M. Schuermans, Philippe Lemmerling, Lieven De Lathauwer, Sabine Van Huffel:
The use of total least squares data fitting in the shape-from-moments problem. Signal Process. 86(5): 1109-1115 (2006) - 2005
- [j12]Nicola Mastronardi
, Philippe Lemmerling, Sabine Van Huffel:
Fast regularized structured total least squares algorithm for solving the basic deconvolution problem. Numer. Linear Algebra Appl. 12(2-3): 201-209 (2005) - [j11]Kris Hermus, Werner Verhelst, Philippe Lemmerling, Patrick Wambacq, Sabine Van Huffel:
Perceptual audio modeling with exponentially damped sinusoids. Signal Process. 85(1): 163-176 (2005) - 2004
- [j10]M. Schuermans, Philippe Lemmerling, Sabine Van Huffel:
Structured weighted low rank approximation. Numer. Linear Algebra Appl. 11(5-6): 609-618 (2004) - 2003
- [j9]Geert Morren, Philippe Lemmerling, Sabine Van Huffel:
Decimative subspace-based parameter estimation techniques. Signal Process. 83(5): 1025-1033 (2003) - 2002
- [j8]Philippe Lemmerling, Sabine Van Huffel, Bart De Moor:
The structured total least-squares approach for non-linearly structured matrices. Numer. Linear Algebra Appl. 9(4): 321-332 (2002) - 2001
- [j7]Philippe Lemmerling, Bart De Moor:
Misfit versus latency. Autom. 37(12): 2057-2067 (2001) - [j6]Philippe Lemmerling, Sabine Van Huffel:
Analysis of the Structured Total Least Squares Problem for Hankel/Toeplitz Matrices. Numer. Algorithms 27(1): 89-114 (2001) - [j5]Philippe Lemmerling, Leentje Vanhamme, Sabine Van Huffel, Bart De Moor:
IQML-like algorithms for solving structured total least squares problems: a unified view. Signal Process. 81(9): 1935-1945 (2001) - 2000
- [j4]Philippe Lemmerling, Nicola Mastronardi, Sabine Van Huffel:
Fast algorithm for solving the Hankel/Toeplitz Structured Total Least Squares problem. Numer. Algorithms 23(4): 371-392 (2000) - [j3]Nicola Mastronardi, Philippe Lemmerling, Sabine Van Huffel:
Fast Structured Total Least Squares Algorithm for Solving the Basic Deconvolution Problem. SIAM J. Matrix Anal. Appl. 22(2): 533-553 (2000) - [c3]Kris Hermus, Werner Verhelst, Patrick Wambacq, Philippe Lemmerling:
Total least squares based subband modelling for scalable speech representations with damped sinusoids. INTERSPEECH 2000: 1129-1132
1990 – 1999
- 1998
- [c2]Philippe Lemmerling, Ioannis Dologlou, Sabine Van Huffel:
Speech compression based on exact modeling and structured total least norm optimization. ICASSP 1998: 353-356 - 1996
- [j2]Johan A. K. Suykens, Philippe Lemmerling, Wouter Favoreel, Bart De Moor, M. Crepel, P. Briol:
Modelling the Belgian Gas Consumption Using Neural Networks. Neural Process. Lett. 4(3): 157-166 (1996) - [j1]Philippe Lemmerling, Bart De Moor, Sabine Van Huffel:
On the equivalence of constrained total least squares and structured total least squares. IEEE Trans. Signal Process. 44(11): 2908-2911 (1996) - [c1]Philippe Lemmerling, Sabine Van Huffel, Bart De Moor:
Structured total least squares methods in signal processing. EUSIPCO 1996: 1-4
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:50 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:
