default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKevin T. Wagner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[c20]Kevin T. Wagner, Milos I. Doroslovacki:
Distributed linear prediction in the presence of noise and multipath. CISS 2017: 1-5- 2016
- [c19]Kevin T. Wagner, Milos I. Doroslovacki:
Distributed linear prediction of a single source. ACSSC 2016: 1395-1399 - [c18]Kevin T. Wagner, Milos I. Doroslovacki:
Distributed LMS estimation of scaled and delayed impulse responses. ICASSP 2016: 4154-4158 - 2015
- [c17]Kevin T. Wagner, Milos I. Doroslovacki:
Improving convergence of distributed LMS estimation by enabling propagation of good estimates through bad nodes. ACSSC 2015: 671-675 - 2014
- [c16]Kevin T. Wagner, Milos I. Doroslovacki:
Performance of proportionate-type NLMS algorithm with gain allocation proportional to the mean square weight deviation. ACSSC 2014: 886-890 - [c15]Kevin T. Wagner, Milos I. Doroslovacki:
Combination coefficients for fastest convergence of distributed LMS estimation. ICASSP 2014: 7218-7222 - 2013
- [c14]Kevin T. Wagner, Milos I. Doroslovacki:
Complex proportionate-type affine projection algorithms. ACSSC 2013: 1510-1514 - [c13]Kevin T. Wagner, Milos I. Doroslovacki:
Transform domain CPtNLMS algorithms. CISS 2013: 1-4 - 2012
- [c12]Kevin T. Wagner, Milos I. Doroslovacki:
Complex colored water-filling algorithm for gain allocation in proportionate adaptive filtering. ACSCC 2012: 1802-1806 - [c11]Kevin T. Wagner, Milos I. Doroslovacki:
Comparisons of one and two adaptation gain complex PtNLMS algorithms. CISS 2012: 1-5 - [c10]Kevin T. Wagner, Milos I. Doroslovacki:
Complex proportionate-type normalized least mean square algorithms. ICASSP 2012: 3285-3288 - 2011
- [j2]Kevin T. Wagner, Milos Doroslovacki:
Probability Density of Weight Deviations Given Preceding Weight Deviations for Proportionate-Type LMS Adaptive Algorithms. IEEE Signal Process. Lett. 18(11): 667-670 (2011) - [j1]Kevin T. Wagner, Milos Doroslovacki:
Proportionate-Type Normalized Least Mean Square Algorithms With Gain Allocation Motivated by Mean-Square-Error Minimization for White Input. IEEE Trans. Signal Process. 59(5): 2410-2415 (2011) - [c9]Kevin T. Wagner, Milos I. Doroslovacki:
Joint conditional and steady-state probability densities of weight deviations for proportionate-type LMS algorithms. ACSCC 2011: 1775-1779 - [c8]Kevin T. Wagner, Milos Doroslovacki:
Reduced computational complexity suboptimal gain allocation for proportionate-type NLMS algorithms with colored inputs. CISS 2011: 1-6 - [c7]Kevin T. Wagner, Milos Doroslovacki:
Proportionate-type normalized least mean square algorithm with gain allocation motivated by minimization of mean-square-weight deviation for colored input. ICASSP 2011: 4124-4127 - 2010
- [c6]Kevin T. Wagner, Milos Doroslovacki:
Proportionate-type NLMS algorithms based on maximization of the joint conditional PDF for the weight deviation vector. ICASSP 2010: 3738-3741
2000 – 2009
- 2009
- [c5]Kevin T. Wagner, Milos Doroslovacki:
Proportional-type NLMS algorithm with gain allocation providing maximum one-step conditional PDF for true weights. CISS 2009: 61-66 - [c4]Kevin T. Wagner, Milos Doroslovacki:
Gain allocation in proportionate-type NLMS algorithms for fast decay of output error at all times. ICASSP 2009: 3117-3120 - 2008
- [c3]Kevin T. Wagner, Milos I. Doroslovacki:
Analytical analysis of transient and steady-state properties of the proportionate NLMS algorithm. ACSCC 2008: 256-260 - [c2]Kevin T. Wagner, Milos Doroslovacki:
Towards analytical convergence analysis of proportionate-type nlms algorithms. ICASSP 2008: 3825-3828 - 2007
- [c1]Kevin T. Wagner, Milos Doroslovacki:
Proportionate-Type Steepest Descent and NLMS Algorithms. CISS 2007: 47-50
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 2025-01-09 13:00 CET 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:
