default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Kailath
- > Home > Persons > Thomas Kailath
Publications
- 2001
[j156]Ali H. Sayed, Thomas Kailath:
A survey of spectral factorization methods. Numer. Linear Algebra Appl. 8(6-7): 467-496 (2001)- 2000
- [j153]Babak Hassibi, Thomas Kailath, Ali H. Sayed:
Array algorithms for H∞ estimation. IEEE Trans. Autom. Control. 45(4): 702-706 (2000) - [c71]Tareq Y. Al-Naffouri, Ali H. Sayed, Thomas Kailath:
On the selection of optimal nonlinearities for stochastic gradient adaptive algorithms. ICASSP 2000: 464-467 - 1999
- [j151]Tibor Boros, Ali H. Sayed, Thomas Kailath:
A recursive method for solving unconstrained tangential interpolation problems. IEEE Trans. Autom. Control. 44(3): 454-470 (1999) - 1997
- [j144]Tiberiu Constantinescu, Ali H. Sayed, Thomas Kailath:
Displacement structure and maximum entropy. IEEE Trans. Inf. Theory 43(3): 1074-1080 (1997) - 1996
- [j142]Ali H. Sayed, Babak Hassibi, Thomas Kailath:
Inertia properties of indefinite quadratic forms. IEEE Signal Process. Lett. 3(2): 57-59 (1996) - [j141]Babak Hassibi, Ali H. Sayed, Thomas Kailath:
Linear estimation in Krein spaces. I. Theory. IEEE Trans. Autom. Control. 41(1): 18-33 (1996) - [j140]Babak Hassibi, Ali H. Sayed, Thomas Kailath:
Linear estimation in Krein spaces. II. Applications. IEEE Trans. Autom. Control. 41(1): 34-49 (1996) - [j137]Babak Hassibi, Ali H. Sayed, Thomas Kailath:
H∞ optimality of the LMS algorithm. IEEE Trans. Signal Process. 44(2): 267-280 (1996) - 1995
- [j133]Tiberiu Constantinescu, Ali H. Sayed, Thomas Kailath:
Displacement Structure and Completion Problems. SIAM J. Matrix Anal. Appl. 16(1): 58-78 (1995) - [j132]Ali H. Sayed, Thomas Kailath:
A Look-Ahead Block Schur Algorithm for Toeplitz-Like Matrices. SIAM J. Matrix Anal. Appl. 16(2): 388-414 (1995) - [j131]Thomas Kailath, Ali H. Sayed:
Displacement Structure: Theory and Applications. SIAM Rev. 37(3): 297-386 (1995) - 1994
- [j113]Ali H. Sayed, Thomas Kailath:
A state-space approach to adaptive RLS filtering. IEEE Signal Process. Mag. 11(3): 18-60 (1994) - [j111]Ali H. Sayed, Thomas Kailath:
Extended Chandrasekhar recursions. IEEE Trans. Autom. Control. 39(3): 619-623 (1994) - [j110]Ali H. Sayed, Tiberiu Constantinescu, Thomas Kailath:
Time-variant displacement structure and interpolation problems. IEEE Trans. Autom. Control. 39(5): 960-976 (1994) - [j109]Tiberiu Constantinescu, Ali H. Sayed, Thomas Kailath:
A recursive Schur-based solution of the four-block problem. IEEE Trans. Autom. Control. 39(7): 1476-1481 (1994) - [j107]Ali H. Sayed, Thomas Kailath, Hanoch Lev-Ari:
Generalized Chandrasekhar recursions from the generalized Schur algorithm. IEEE Trans. Autom. Control. 39(11): 2265-2269 (1994) - [j100]Ali H. Sayed, Hanoch Lev-Ari, Thomas Kailath:
Time-variant displacement structure and triangular arrays. IEEE Trans. Signal Process. 42(5): 1052-1062 (1994) - 1993
- [c57]Babak Hossein Khalaj, Ali H. Sayed, Thomas Kailath:
A unified derivation of square-root multichannel least-squares filtering algorithms. ICASSP (5) 1993: 523-526 - [c56]Ali H. Sayed, Thomas Kailath:
A state-space approach to adaptive filtering. ICASSP (3) 1993: 559-562 - [c54]Babak Hassibi, Ali H. Sayed, Thomas Kailath:
Optimality Criteria for LMS and Backpropagation. NIPS 1993: 351-358 - 1992
- [c51]Ali H. Sayed, Hanoch Lev-Ari, Thomas Kailath:
Lattice filter interpretations of the Chandrasekhar recursions for estimation and spectral factorization. ICASSP 1992: 549-552
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.
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.
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.
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 2025-05-14 22:06 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:
