Demo Data from SIGIR 2026 / reviewers in the wild / expert
T. W. Mullikin
dblp:95/6568
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 1965
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1
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 · 60% Mathematical optimization · 40% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Computational science and engineering · 100% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information theory › probability theory › stochastic processes › stochastic signals
gaussian signals |
0.0 | 1 | 1965 | The likelihood ratio filter for the detection of Gaussian signals in white noise · IEEE Trans. Inf. Theory 1965 |
Information theory
hypothesis testing |
0.0 | 1 | 1965 | The likelihood ratio filter for the detection of Gaussian signals in white noise · IEEE Trans. Inf. Theory 1965 |
Computational science and engineering
partial differential equation solver |
0.0 | 1 | 1960 | On the Increase of Convergence Rates of Relaxation Procedures for Elliptic Partial Difference Equations · J. ACM 1960 |
Information theory › probability theory › stochastic processes › stochastic process representation
covariance function |
0.0 | 1 | 1965 | The likelihood ratio filter for the detection of Gaussian signals in white noise · IEEE Trans. Inf. Theory 1965 |
Mathematical optimization › numerical computation
iterative linear solver |
0.0 | 1 | 1960 | On the Increase of Convergence Rates of Relaxation Procedures for Elliptic Partial Difference Equations · J. ACM 1960 |
Mathematical optimization
numerical analysis |
0.0 | 1 | 1960 | On the Increase of Convergence Rates of Relaxation Procedures for Elliptic Partial Difference Equations · J. ACM 1960 |
Mathematical optimization
relaxation |
0.0 | 1 | 1960 | On the Increase of Convergence Rates of Relaxation Procedures for Elliptic Partial Difference Equations · J. ACM 1960 |
Methods — techniques the papers use, named apart from their topics
spectral density · 0.0perron-frobenius theory · 0.0jacobi-richardson iteration · 0.0integral equations · 0.0gaussian elimination · 0.0gauss-seidel iteration · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1965 | The likelihood ratio filter for the detection of Gaussian signals in white noiseabstractThis paper derives a solution to the equation\rho (u, s) = N_{0}h(s, u) + \int_{0}^{T} \rho (t, s)h(t, u) dt, for the case in which the kernel is the covariance function of a stationary random process whose spectral density is a rational function of frequency. T. W. Mullikin, Ivan Selin |
IEEE Trans. Inf. Theory | 1 |
| 1960 | On the Increase of Convergence Rates of Relaxation Procedures for Elliptic Partial Difference EquationsabstractOccasionally in the numerical solution of elliptic partial differential equations the rate of convergence of relaxation methods to the solution is adversely affected by the relative proximity of certain points in the grid. It has been proposed that the removal of the unknown functional values at these points by Gaussian elimination may accelerate the convergence. By application of the Perron-Frobenius theory of non-negative matrices it is shown that the rates of convergence of the Jacobi-Richardson and Gauss-Seidel iterations are not decreased and could be increased by this elimination. Although this may indicate that the elimination could improve the convergence rate for overrelaxation, it is still strictly an unsolved problem. Mario L. Juncosa, T. W. Mullikin |
J. ACM | 2 |