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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Douglas Sauder

dblp:49/2797 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1991
—ORCID · none

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

Theory 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
1 paper
Information theory · 100%

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

TopicWeightPapersLastEvidence papers
Information theory
dependent data
0.011991
Optimal and robust memoryless discrimination from dependent observations · IEEE Trans. Inf. Theory 1991
Information theory
hypothesis testing
0.011991
Optimal and robust memoryless discrimination from dependent observations · IEEE Trans. Inf. Theory 1991
Information theory › hypothesis testing
signal detection
0.011991
Optimal and robust memoryless discrimination from dependent observations · IEEE Trans. Inf. Theory 1991
Information theory › hypothesis testing
robust detection
0.011991
Optimal and robust memoryless discrimination from dependent observations · IEEE Trans. Inf. Theory 1991

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

nonlinearity design · 0.0integral equations · 0.0
YearPublicationVenuePosition
1991 Optimal and robust memoryless discrimination from dependent observations
abstract
Discrimination is considered between two possible sources based on dependent observations of their output. The discrimination problem is modeled by means of a general binary hypothesis test, the main emphasis being on situations that cannot be modeled as signals in additive noise. The observations are modeled as stationary m-dependent or rho -mixing processes. The structure of the discriminator is such that the observations are passed through a memoryless nonlinearity summed up to form a test statistic, which is then compared to a threshold. Only fixed sample size tests are considered. Four different performance measures, which resemble the signal-to-noise ratios encountered in the signal in additive noise problems, are derived under different problem formulations. The optimal nonlinearities for each of the performance measures are derived as solutions to various integral equations. For three of the four performance measures the authors have successfully obtained robust nonlinearities for uncertainty in the marginal and the joint probability density functions of the observations. Computer simulation results that demonstrate the advantage of using these nonlinearities over the i.i.d. nonlinearity under the probability of error criterion are presented.>
Douglas Sauder, Evaggelos Geraniotis
IEEE Trans. Inf. Theory1