Tomas Gänsler

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▷ joint publications with Man Mohan Sondhi

> Home > Persons > Tomas Gänsler

Publications

2001
[c8]
- view
  authority control:
- export record
  dblp key:
  - conf/icassp/GanslerBSG01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icassp/GanslerBSG01
Tomas Gänsler, Jacob Benesty, Man Mohan Sondhi, Steven L. Gay:
Dynamic resource allocation for network echo cancellation. ICASSP 2001: 3233-3236
2000
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/taslp/GanslerGSB00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/taslp/GanslerGSB00
Tomas Gänsler, Steven L. Gay, Man Mohan Sondhi, Jacob Benesty:
Double-talk robust fast converging algorithms for network echo cancellation. IEEE Trans. Speech Audio Process. 8(6): 656-663 (2000)
[c6]
- view
  - electronic edition @ ieee.org
  - no references & citations available
- export record
  dblp key:
  - conf/eusipco/BenestySG00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/eusipco/BenestySG00
Jacob Benesty, Man Mohan Sondhi, Tomas Gänsler:
An augmented iterative method for large linear Toeplitz systems. EUSIPCO 2000: 1-4
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/icassp/GanslerBGS00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icassp/GanslerBGS00
Tomas Gänsler, Jacob Benesty, Steven L. Gay, Man Mohan Sondhi:
A robust proportionate affine projection algorithm for network echo cancellation. ICASSP 2000: 793-796

a service of

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.