Howard L. Weinert

dblp:38/2641 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 1978
—ORCID · none

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

Theory of computation · 3 · 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 · 44% Algorithms and data structures · 44% Mathematical optimization · 13%

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

TopicWeightPapersLastEvidence papers
Algorithms and data structures
recursive algorithms
0.011978
A stochastic framework for recursive computation of spline functions-Part I: Interpolating splines · IEEE Trans. Inf. Theory 1978
Information theory
signal processing
0.011978
A stochastic framework for recursive computation of spline functions-Part I: Interpolating splines · IEEE Trans. Inf. Theory 1978

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

reproducing kernel hilbert space · 0.0
YearPublicationVenuePosition
1978 A stochastic framework for recursive computation of spline functions-Part I: Interpolating splines
abstract
The method for exploiting stochastic smoothing techniques to develop dynamical recursive algorithms for the deterministic problem of d interpolation (optimal curve fitting) is shown. A reproducing kernel Hilbert space approach is used to develop an explicit correspondence between spline interpolation and linear least-squares smoothing of a particular zero-mean random process. This random process is shown to be the output of a white-noise-driven dynamical system whose parameters and initial conditions are fixed by the functional form chosen for the spline. A recursive algorithm is then derived for this (nonstandard) smoothing problem, and thus also for the original spline interpolation problem.
Howard L. Weinert, Gursharan S. Sidhu
IEEE Trans. Inf. Theory1
1975 An RKHS approach to detection and estimation problems-II: Gaussian signal detection
abstract
The theory of reproducing kernel Hilbert spaces is used to obtain a simple but formal expression for the likelihood ratio (LR) for discriminating between two Gaussian processes with unequal covariances, and to develop a test by which the formal expression can be checked for validity. This LR formula can be evaluated by working separately with each covariance, thus reducing the calculations for the random signal case to those for the simpler known signal problem. In contrast, all previous LR formulas for the unequal covariance problem seem to require calculations involving both covariances simultaneously.
Thomas Kailath, Howard L. Weinert
IEEE Trans. Inf. Theory2
1972 Some relations among RKHS norms, Fredholm equations, and innovations representations
abstract
We first show how reproducing kernel Hilbert space (RKHS) norms can be determined for a large class of covariance functions by methods based on the solution of a Riccati differential equation or a Wiener-Hopf integral equation. Efficient numerical algorithms for such equations have been extensively studied, especially in the control literature. The innovations representations enter in that it is they that suggest the form of the RKHS norms. From the RKHS norms, we show how recursive solutions can be obtained for certain Fredholm equations of the first kind that are widely used in certain approaches to detection theory. Our approach specifies a unique solution: moreover, the algorithms used are well suited to the treatment of increasing observation intervals.
Thomas Kailath, Roger T. Geesey, Howard L. Weinert
IEEE Trans. Inf. Theory3