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

Samuel Zahl

dblp:134/0020 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1964
—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 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information theory › estimation theory
linear estimation
0.011964
The linear prediction of deterministic signals · IEEE Trans. Inf. Theory 1964
Information theory › signal processing
statistical signal processing
0.011964
The linear prediction of deterministic signals · IEEE Trans. Inf. Theory 1964

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

wiener filtering · 0.0quadratic programming · 0.0minimax estimation · 0.0
YearPublicationVenuePosition
1964 The linear prediction of deterministic signals
abstract
A method is presented for linear estimations of functionals of deterministic signals containing additive noise. The method is based on statistical decision theory and assumes discrete observations. In general terms a deterministic signal, with the noise subtracted, is a member of a class of functions with no probability distribution over the members of the class. In this paper the class is restricted to real one-dimensional functions parametrized by a real vector. The linear minimax estimate of the function to be estimated is proposed and the problem of computing it shown to be equivalent to a quadratic programming problem which can be solved exactly when the class of true signals is finite and sometimes when the class is infinite. In the latter case the problem can be solved approximately, subject to some mild restrictions on the signal. The exact algebraic solution is given for prediction of linear signals for up to three observations and is compared with the solution based on Wiener's theory.
Samuel Zahl
IEEE Trans. Inf. Theory1