Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

M. W. Thompson

dblp:60/5895 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1994
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 first-authorTheory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Information theory · 65% Mathematical optimization · 35%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information theory › hypothesis testing
robust detection
0.011994
Robust detection in nominally Laplace noise · IEEE Trans. Commun. 1994
Information theory › hypothesis testing
signal detection
0.011994
Robust detection in nominally Laplace noise · IEEE Trans. Commun. 1994
Information theory
dependent data
0.011993
Robust estimation of signal parameters with nonstationary and/or dependent data · IEEE Trans. Inf. Theory 1993
Mathematical optimization › statistical estimation
robust estimation
0.011993
Robust estimation of signal parameters with nonstationary and/or dependent data · IEEE Trans. Inf. Theory 1993
Mathematical optimization
statistical estimation
0.011993
Robust estimation of signal parameters with nonstationary and/or dependent data · IEEE Trans. Inf. Theory 1993
Information theory › hypothesis testing › binary hypothesis testing
neyman-pearson detection
0.011994
Robust detection in nominally Laplace noise · IEEE Trans. Commun. 1994

Methods — techniques the papers use, named apart from their topics

saddlepoint methodology · 0.0huber robust statistics · 0.0saddle point technique · 0.0censoring · 0.0
YearPublicationVenuePosition
1994 Robust detection in nominally Laplace noise
abstract
The authors consider the robust detection of a known constant signal in additive, mutually independent and identically distributed noise which is nominally Laplace. Employing the classical saddlepoint methodology of Huber (1951), they specify the form of the robust detector and obtain closed form results which allow for the analysis of the performance of the robust detector. They show via examples that the robustness can entail a considerable cost in detector performance. In addition, they compare the performance of the robust detector to that of the Neyman-Pearson detector for examples where the noise is Laplace and also where the noise is least favorable for the given detector.>
M. W. Thompson, Don R. Halverson, Gary L. Wise
IEEE Trans. Commun.1
1993 Robust estimation of signal parameters with nonstationary and/or dependent data
abstract
A new approach toward robust parameter estimation is presented. As opposed to schemes based on classical saddlepoint techniques, the methods apply quite naturally to dependent and/or nonstationary data and also have the advantage of providing a quantitative measure of the degree of robustness offered by a particular estimator. It is shown why censoring observations of large magnitude does indeed impart robustness, and it also shown how nontraditional schemes have certain advantages, particularly when trading off performance and robustness. The application of the results is further demonstrated by including several illustrative examples.>
M. W. Thompson, Don R. Halverson, C. Tsai
IEEE Trans. Inf. Theory1